Games with winning conditions of high Borel complexity

DOI10.1016/j.tcs.2005.10.024zbMath1125.91024OpenAlexW2073412815MaRDI QIDQ817850

Olivier Serre

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.024

zbMATH Keywords

pushdown automatainfinite two player gameswinning decidable condition

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Related Items

Solving Infinite Games in the Baire Space ⋮ Polishness of some topologies related to word or tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on winning positions on pushdown games with \(\omega\)-regular conditions
• Borel determinacy
• \(\omega\)-computations on deterministic pushdown machines
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Topology and descriptive set theory
• Games for synthesis of controllers with partial observation.
• Pushdown processes: Games and model-checking
• Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank
• On the synthesis of strategies in infinite games
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computer Science Logic
• On model checking for the \(\mu\)-calculus and its fragments
• Topological properties of omega context-free languages