Abstract
We introduce a machine model for the execution of strategies in (regular) infinite games that refines the standard model of Mealy automata. This model of controllers is formalized in the terminological framework of Turing machines. We show how polynomially sized controllers can be found for Muller and Streett games. We are able to distinguish aspects of executing strategies ("size", "latency", "space consumption") that are not visible in Mealy automata. Also, lower bound results are obtained. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Gelderie, M. (2012). Strategy machines and their complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 431–442). https://doi.org/10.1007/978-3-642-32589-2_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
