On Reachability Games of Ordinal Length

DOI10.1007/978-3-540-77566-9_18MaRDI QIDQ5448648zbMATH OpenOpenAlexFDO

Authors Julien Cristau, Florian Horn

Publication date 7 March 2008

Published in SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77566-9_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Applications of game theory (91A80)

Recommendations

• Graph games on ordinals
• Finitary winning in \({\omega}\)-regular games
• Tools and Algorithms for the Construction and Analysis of Systems
• Controller Synthesis and Ordinal Automata
• Faster Algorithms for Finitary Games

Cites work

• A theory of timed automata
• Automata, Languages and Programming
• Automata, logics, and infinite games. A guide to current research
• Automated Technology for Verification and Analysis
• Borel determinacy
• Computer Science Logic
• Controller Synthesis and Ordinal Automata
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• scientific article; zbMATH DE number 1303059 (Why is no real title available?)
• scientific article; zbMATH DE number 1834651 (Why is no real title available?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Mathematical Foundations of Computer Science 2005
• On the synthesis of strategies in infinite games
• Reachability-Time Games on Timed Automata

Cited in

(6)

• Reachability is decidable in the numbers game
• Graph games on ordinals
• Controller Synthesis and Ordinal Automata
• On the Complexity of Counter Reachability Games
• Finite high-order games and an inductive approach towards Gowers's dichotomy
• On higher-order reachability games vs may reachability

This page was built for publication: On Reachability Games of Ordinal Length

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