Strategy machines and their complexity

DOI10.1007/978-3-642-32589-2_39MaRDI QIDQ2912742zbMATH OpenOpenAlexFDO

Authors Marcus Gelderie

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_39

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80)

Recommendations

• scientific article; zbMATH DE number 2077117
• scientific article; zbMATH DE number 1017515
• Finite-state strategies in delay games
• Automata and games for synthesis
• Infinite games on finitely coloured graphs with applications to automata on infinite trees

Cited in

(3)

• Synthesizing structured reactive programs via deterministic tree automata
• Automata and compositional strategies in extensive form games
• Determinancy with Complicated Strategies

This page was built for publication: Strategy machines and their complexity

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