×

Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes. (English) Zbl 0386.03018


MSC:

03D05 Automata and formal grammars in connection with logical questions
68Q45 Formal languages and automata
03B25 Decidability of theories and sets of sentences
Full Text: DOI

References:

[1] Büchi, J. R., On a decision method in restricted second-order arithmetic, (Proceedings of the International Congress on Logic, Methodology and Philosophy of Sciences 1960 (1962), Stanford Univ. Press: Stanford Univ. Press Stanford, Calif) · Zbl 0215.32401
[2] Büchi, J. R., Decision methods in the theory Of ordinals, Bull. Amer. Math. Soc., 71, 767-770 (1965) · Zbl 0207.30904
[3] Buchi, J. R.; Siefkes, D., The monadic Second-Order Theory of All Countable Ordinals, (Lecture Notes in Mathematics (1973), Springer-Verlag: Springer-Verlag Berlin), No. 328 · Zbl 0298.02050
[4] Choueka, Y., Finite Automata on Infinite Structures, (Ph.D. Dissertation (1970), The Hebrew University: The Hebrew University Jerusalem)
[5] Choueka, Y., Theories of automata on to-tapes: A simplified approach, J. Comput. System Sci., 8, 117-141 (1974) · Zbl 0292.02033
[6] Coven, R. S.; Gold, Y., Theory of ω-languages, (TR 56 (1975), Computer Science Dept., Technion, Israel Inst. of Technology: Computer Science Dept., Technion, Israel Inst. of Technology Haifa, Israel), Part III
[7] Coven, R. S.; Gold, Y., ω-computations on Turing machines, (TR 76 (1976), Comp. Science Dept., Technion, Israel Inst. of Technology: Comp. Science Dept., Technion, Israel Inst. of Technology Haifa, Israel) · Zbl 0368.68057
[8] Elgot, C. C.; Rabin, M. O., Decidability and undecidability of extensions of second (first) order theories of (generalized) successor, J. Symbolic Logic, 31, 169-181 (1966) · Zbl 0144.24501
[9] Linna, M., On ω-sets associated with context-free languages, Inform. Contr., 31, 272-293 (1976) · Zbl 0329.68066
[10] Linna, M., A Decidability Result for Deterministic ω-Context-Free Languages (1976), Dept. of Math., University of Turku: Dept. of Math., University of Turku Finland, Preprint, Series No. 2 · Zbl 0362.68110
[11] McNaughton, R., Testing and generating infinite sequences by a finite automaton, Inform. Contr., 9, 521-530 (1966) · Zbl 0212.33902
[12] Rabin, M.; Scott, D., Finite automata and their decision problems, IBM J. Res. Develop., 3, 114-125 (1959) · Zbl 0158.25404
[13] Rabin, M., Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc., 141, 1-35 (1969) · Zbl 0221.02031
[14] Siefkes, D., Decidable extensions of monadic second-order successor arithmetic, (Dörr, J.; Hotz, G., Automatic theories and formale Sprachen, Bericht tagung Oberwolfach Okt. 1969 (1970)), 441-472, Mannheim · Zbl 0213.01901
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.