Game Development Reference
In-Depth Information
J. R. Buchi. State-strategies for games in F σδ
G δσ . The Journal of Symbolic Logic ,
48(4):1171-1198, December 1983.
J. R. Buchi and L. H. Landweber. Solving sequential conditions by finite-state
strategies. Transactions of the American Mathematical Society , 138:295-311,
T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs
and parity games. In Proceedings of Automata, Languages and Programming,
30th International Colloquium, ICALP 2003 , volume 2719 of Lecture Notes in
Computer Science , pages 556-569. Springer, 2003.
T. Cachat, J. Duparc, and W. Thomas. Solving pushdown games with a Σ 3
winning condition. In Proceedings of the Annual Conference of the European
Association for Computer Science Logic, CSL 2002 , volume 2471 of Lecture
Notes in Computer Science , pages 322-336. Springer, 2002.
A. Church. Logic, arithmetic and automata. In Proceedings of the International
Congress of Mathematicians , pages 23-35, 1962.
T. Colcombet and K. Zdanowski. A tight lower bound for determinization of
transition labeled Buchi automata. In Proceedings of Automata, Languages
and Programming, 36th Internatilonal Collogquium, ICALP 2009 , volume 5556
of Lecture Notes in Computer Science , pages 151-162. Springer, 2009.
E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of
programs (exteded abstract). In Proceedings of the 29th Annual Symposium
on Foundations of Computer Science, FoCS '88 , pages 328-337, Los Alamitos,
California, October 1988. IEEE Computer Society Press.
E. Gradel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite
Games , volume 2500 of Lecture Notes in Computer Science . Springer, 2002.
Y. Gurevich and L. Harrington. Trees, automata and games. In Proceedings of
the 14th Annual ACM Symposium on Theory of Computing, STOC '82 , pages
60-65, 1982.
M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown
automata and recursion schemes. In Proceedings of the Twenty-Third Annual
IEEE Symposium on Logic in Computer Science, LICS 2008 , pages 452-461.
IEEE Computer Society, 2008.
G. J. Holzmann. The Spin Model Checker - Primer and Reference Manual . Addison-
Wesley, 2003.
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and
Computation . Addison Wesley, 1979.
D. Kahler and T. Wilke. Complementation, disambiguation, and determinization of
Buchi automata unified. In Proceedings of the 35th International Colloquium
on Automata, Languages and Programming, ICALP 2008, Part I , volume 5125
of Lecture Notes in Computer Science , pages 724-735. Springer, 2008.
L. H. Landweber. Decision problems for ω -automata. Mathematical Systems Theory ,
3:376-384, 1969.
C. Loding, P. Madhusudan, and O. Serre. Visibly pushdown games. In Proceedings
of the 24th Conference on Foundations of Software Technology and Theoretical
Computer Science, FST TCS 2004 , volume 3328 of Lecture Notes in Computer
Science , pages 408-420. Springer, 2004.
R. McNaughton. Testing and generating infinite sequences by a finite automaton.
Information and Control , 9(5):521-530, 1966.
Search Nedrilad ::

Custom Search