On Reachability Games of Ordinal Length

DOI10.1007/978-3-540-77566-9_18zbMath1133.68034OpenAlexW2132428429MaRDI QIDQ5448648

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) Applications of game theory (91A80) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Borel determinacy
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• A theory of timed automata
• Automata, logics, and infinite games. A guide to current research
• Controller Synthesis and Ordinal Automata
• On the synthesis of strategies in infinite games
• Computer Science Logic
• Reachability-Time Games on Timed Automata
• Automated Technology for Verification and Analysis
• Mathematical Foundations of Computer Science 2005
• Automata, Languages and Programming

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