Game Development Reference
In-Depth Information
A. R. Meyer. Weak monadic second order theory of succesor is not elementary-
recursive. In Logic Colloquium , volume 453 of Lecture Notes in Mathematics ,
pages 132-154. Springer, 1975.
A. W. Mostowski. Games with forbidden positions. Technical Report 78, Uniwersytet
Gdanski, Instytut Matematyki, 1991.
D. E. Muller and P. E. Schupp. Simulating alternating tree automata by nonde-
terministic automata: New results and new proofs of the theorems of Rabin,
McNaughton and Safra. Theoretical Computer Science , 141(1&2):69-107, 1995.
D. Perrin and J.-E. Pin. Infinite words , volume 141 of Pure and Applied Mathematics .
Academic Press, London, 2004.
N. Piterman. From nondeterministic Buchi and Streett automata to deterministic
parity automata. In Proceedings of the 21st IEEE Symposium on Logic in
Computer Science (LICS 2006) , pages 255-264. IEEE Computer Society, 2006.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer
Science , 13:45-60, 1981.
A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings
of the Symposium on Principles of Programming Languages, POPL'89 , pages
179-190, 1989.
M. O. Rabin. Decidability of second-order theories and automata on infinite trees.
Transactions of the American Mathematical Society , 141:1-35, July 1969.
M. O. Rabin. Automata on Infinite Objects and Church's Problem . American
Mathematical Society, Boston, MA, USA, 1972.
K. Reinhardt. The complexity of translating logic to finite automata. In Automata,
Logics, and Infinite Games , volume 2500 of Lecture Notes in Computer Science ,
pages 231-238. Springer, 2002.
R. Rosner. Modular Synthesis of Reactive Systems . PhD thesis, Weizmann Institute
of Science, Rehovot, Israel, 1991.
S. Safra. On the complexity of omega-automata. In Proceedings of the 29th Annual
Symposium on Foundations of Computer Science, FoCS '88 , pages 319-327,
Los Alamitos, California, October 1988. IEEE Computer Society Press.
S. Schewe. Tighter bounds for the determinisation of Buchi automata. In Proceed-
ings of Foundations of Software Science and Computational Structures, 12th
International Conference, FOSSACS 2009 , volume 5504 of Lecture Notes in
Computer Science , pages 167-181. Springer, 2009.
O. Serre. Games with winning conditions of high Borel complexity. In Proceedings of
Automata, Languages and Programming: 31st International Colloquium, ICALP
2004 , volume 3142 of Lecture Notes in Computer Science , pages 1150-1162.
Springer, 2004.
M. Sipser. Introduction to the Theory of Computation . PWS Publishing Company,
Boston, 1997.
W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa,
editors, Handbook of Formal Language Theory , volume III, pages 389-455.
Springer, 1997.
M. Y. Vardi. Reasoning about the past with two-way automata. In K. G. Larsen,
S. Skyum, and G. Winskel, editors, Proceedings of the 25th International
Colloquium on Automata, Languages and Programming, ICALP'98 , volume
1443 of Lecture Notes in Computer Science , pages 628-641. Springer, 1998.
M. Y. Vardi and T. Wilke. Automata: from logics to algorithms. In Logic and
Automata - History and Perspectives , volume 2 of Texts in Logic and Games ,
pages 629-724. Amsterdam University Press, Amsterdam, 2007.
Search Nedrilad ::

Custom Search