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

Pierre Marcus, Ilkka Törmä (2021)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2021-05-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics