The Determinacy of Context-Free Games

DOI10.4230/LIPIcs.STACS.2012.555zbMath1254.03077arXiv1112.1186OpenAlexW2243005836MaRDI QIDQ2904793

Olivier Finkel

Publication date: 23 August 2012

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.1186

zbMATH Keywords

automataformal languagesdeterminacylogic in computer scienceGale-Stewart gamesWadge gamescontext-free games

Mathematics Subject Classification ID

Descriptive set theory (03E15) Games involving topology, set theory, or logic (91A44) Automata and formal grammars in connection with logical questions (03D05) Determinacy principles (03E60)

Related Items (7)

Solving Infinite Games in the Baire Space ⋮ Infinite games specified by 2-tape automata ⋮ On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Locally finite ω-languages and effective analytic sets have the same topological complexity ⋮ An upper bound on the complexity of recognizable tree languages ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words

This page was built for publication: The Determinacy of Context-Free Games