Showing cs.FLShow all
2 papers · 1 filter
cs.FL2021
Winning Sets of Regular Languages: Descriptional and Computational Complexity
Pierre Marcus, Ilkka Törmä
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 A…
cs.FL2020
Descriptional Complexity of Winning Sets of Regular Languages
Pierre Marcus, Ilkka Törmä
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 A…