On polynomial-size programs winning finite-state games
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 239-252
- https://doi.org/10.1007/3-540-60045-0_54
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Tree automata, mu-calculus and determinacyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the synthesis of discrete controllers for timed systemsPublished by Springer Nature ,1995
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- On the synthesis of a reactive modulePublished by Association for Computing Machinery (ACM) ,1989
- Automata, tableaux, and temporal logicsPublished by Springer Nature ,1985
- State-strategies for games in Fσδ ∩ GδσThe Journal of Symbolic Logic, 1983
- Trees, automata, and gamesPublished by Association for Computing Machinery (ACM) ,1982
- Decision problems forω-automataTheory of Computing Systems, 1969
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969