Church's problem and a tour through automata theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4800 LNCS, Issue , 2008, Pages 635-655

  Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GAME THEORY; RELIGIOUS BUILDINGS; TECHNOLOGY; TRANSLATION (LANGUAGES);

ACCEPTANCE CONDITIONS; DETERMINIZATION; FINITE-STATE MACHINES; MONADIC SECOND-ORDER LOGIC; REACHABILITY ANALYSIS;

AUTOMATA THEORY;

EID: 49949096554     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78127-1_35     Document Type: Conference Paper

References (28)

1. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66-92 (1960)
2. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Nagel, E., et al. (eds.) Proc. 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. 1-11. Stanford University Press (1962)
3. Büchi, J.R., Elgot, C.C.: Decision problems of weak second-order arithmetics and finite automata, Abstract 553-112, Notices Amer. Math. Soc. 5, 834 (1958)
4. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies, Trans. Trans. Amer. Math. Soc 138, 367-378 (1969)
5. Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. In: Summaries of the Summer Institute of Symbolic Logic, vol. I, pp. 3-50. Cornell Univ, Ithaca, N.Y (1957)
6. Church, A.: Logic, arithmetic, and automata,. In: Proc. Int. Congr. Math. 1962, Inst. Mittag-Leffler, Djursholm, Sweden, pp. 23-35 (1963)
7. Dziembowski, S., Jurdziñski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proc. 12th IEEE Symp. on Logic in Computer Science, pp. 99-110. IEEE Computer Society Press, Los Alamitos (1997)
8. Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21-52 (1961)
9. Emerson, E.A., Jutla, CS.: Tree automata, mu-calculus, and determinacy. In: Proc. 32nd FoCS 1991, pp. 368-377. IEEE Comp. Soc. Press, Los Alamitos (1991)
10. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. 14th ACM Symp. on the Theory of Computing, pp. 60-65. ACM Press, New York (1982)
11. Hopcroft, J.E., Ullman, J.D.: Formal Languages and Their Relation to Automata. Addison-Wesley, Boston (1969)
12. McNaughton, R.: Finite-state infinite games, Project MAC Rep. MIT, Cambridge (1965)
13. McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inf. Contr. 9, 521-530 (1966)
14. McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65, 149-184 (1993)
15. Moore, E.F. (ed.): Sequential Machines - Selected Papers. Addison-Wesley, Read-ing, Mass (1963)
16. Mostowski, A.W.: Regular expressions for infinite trees and a standard form of automata. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 157-168. Springer, Heidelberg (1985)
17. Muller, D.E.: Infinite sequences and finite machines. In: Proc. 4th IEEE Ann. Symp. on Switching Circuit Theory and Logical Design, pp. 3-16. IEEE Press, Los Alamitos (1963)
18. Muller, D.E., Schupp, P.E.: Simulating alternating tree automata, by nondeterministic automata: New results and new proofs of the results of Rabin, McNaughton, and Safra. Theor. Comput. Sci. 141, 69-107 (1995)
19. Myhill, J.: Finite automata and the representation of events, WADC Tech. Rep. 57-624, pp. 112-137 (1957)
20. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1-35 (1969)
21. Rabin, M.O.: Automata on infinite objects and Church's Problem, Amer. Math. Soc, Providence RI (1972)
22. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114-125 (1959)
23. Safra, S.: On the complexity of omega-automata. In: Proc. 29th Ann. Symp.on Foundations of Computer Science, White Plains, New York, pp. 319-327. IEEE Computer Society Press, Los Alamitos (1988)
24. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E. W., Puech, C (eds.) STACS 1995. LNCS, vol. 900, pp. 1-13. Springer, Heidelberg (1995)
25. Thomas, W.: Solution of Church's Problem: A tutorial. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction, vol. 5, Amsterdam Univ. Press, Texts on Logic and Games (to appear)
26. Trakhtenbrot, B.A.: On operators realizable in logical nets. Dokl. Akad. Naut. SSSR 112, 1005-1007 (1957) (in Russian)
27. Trakhtenbrot, B.A.: Synthesis of logical nets whose operators are described of monadic predicates. Dokl. Akad. Naut. SSSR 118, 646-649 (1958) (in Russian)
28. Trakhtenbrot, B.A., Barzdin, Ya.M.: Finite Automata. Behavior and Synthesis. North-Holland, Amsterdam (1973)