Descriptional Complexity of Winning Sets of Regular Languages
Formal Languages and Automata Theory
2020-04-29 v1
Abstract
We investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with Alice winning if the result lies in a predetermined target language. The turn orders that result in a win for Alice form a binary language that is regular whenever the target language is, and we prove some upper and lower bounds for its state complexity based on that of the target language.
Cite
@article{arxiv.2004.13668,
title = {Descriptional Complexity of Winning Sets of Regular Languages},
author = {Pierre Marcus and Ilkka Törmä},
journal= {arXiv preprint arXiv:2004.13668},
year = {2020}
}
Comments
18 pages, 7 figures