Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Languages, automata, and logic
Handbook of formal languages, vol. 3
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Varieties Of Formal Languages
Positive Varieties and Infinite Words
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Journal of Computer and System Sciences
Fine hierarchy of regular aperiodic ω-languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Church's problem and a tour through automata theory
Pillars of computer science
Logical refinements of Church's problem
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We analyze ω-languages generated from certain classes κ of regular languages of finite words (called *-languages), using natural transformations of *-languages into ω-languages. Winning strategies for infinite games can be represented again in terms of *-languages. Continuing work of Selivanov (2007) and Rabinovich et al. (2007), we analyze how these "strategy *-languages" are related to the original language class κ. In contrast to that work, we exhibit classes κ where strategy representations strictly exceed κ.