"Winning Sets of Regular Languages: Descriptional and Computational Complexity."

Pierre Marcus, Ilkka Törmä (2023)

Details and statistics

DOI: 10.25596/JALC-2023-089

access: closed

type: Journal Article

metadata version: 2023-10-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics