Games with winning conditions of high Borel complexity

DOI10.1016/J.TCS.2005.10.024zbMATH Open1125.91024OpenAlexW2073412815MaRDI QIDQ817850FDOQ817850

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

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

zbMATH Keywords

pushdown automatainfinite two player gameswinning decidable condition

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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)