Games with winning conditions of high Borel complexity

DOI10.1016/J.TCS.2005.10.024MaRDI QIDQ817850zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Automata, Languages and Programming
• On winning conditions of high Borel complexity in pushdown games
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 16390
• Game-theoretical aspects of the Borel conjecture
• Borel Games and the Baire Property
• Complexities of winning strategies in diophantine games
• On the complexity of problems on simple games
• Algorithms – ESA 2005
• Determinateness of certain almost-Borel games

Cites work

• scientific article; zbMATH DE number 1670767 (Why is no real title available?)
• scientific article; zbMATH DE number 1670778 (Why is no real title available?)
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 1948167 (Why is no real title available?)
• scientific article; zbMATH DE number 1948171 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Borel determinacy
• Computer Science Logic
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Games for synthesis of controllers with partial observation.
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Note on winning positions on pushdown games with \(\omega\)-regular conditions
• On model checking for the \(\mu\)-calculus and its fragments
• On the synthesis of strategies in infinite games
• Pushdown processes: Games and model-checking
• Topological properties of omega context-free languages
• Topology and descriptive set theory
• Uniform solution of parity games on prefix-recognizable graphs
• Wadge hierarchy and Veblen hierarchy. I: Borel sets of finite rank
• \(\omega\)-computations on deterministic pushdown machines

Cited in

(6)

• On winning conditions of high Borel complexity in pushdown games
• Solving Infinite Games in the Baire Space
• Mathematical Foundations of Computer Science 2005
• Polishness of some topologies related to word or tree automata
• Automata, Languages and Programming
• n-point, win-by-k games

This page was built for publication: Games with winning conditions of high Borel complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817850)