Automata, Languages and Programming

DOI10.1007/B99859zbMATH Open1099.03510OpenAlexW2505584480MaRDI QIDQ5466545

Olivier Serre

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

zbMATH Keywords

Pushdown AutomataBorel ComplexityTwo-player Games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Descriptive set theory (03E15) Games involving topology, set theory, or logic (91A44) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

n-point, win-by-k games ⋮ Games with winning conditions of high Borel complexity

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Games with winning conditions of high Borel complexity 👍 👎
• Complexities of winning strategies in diophantine games 👍 👎
• Borel Games and the Baire Property 👍 👎
• Determinateness of certain almost-Borel games 👍 👎
• Game-theoretical aspects of the Borel conjecture 👍 👎
• On the complexity of problems on simple games 👍 👎
• Algorithms – ESA 2005 👍 👎
• Mathematical Foundations of Computer Science 2005 👍 👎

This page was built for publication: Automata, Languages and Programming