Summary of decision problems for \(\omega\)-automata. (English) Zbl 0182.02402

Full Text: DOI


[1] J. R. Büchi, On a decision method in restricted second order arithmetic,Logic, Methodology and Philosophy of Science (Proc. 1960Internat. Congr.); Stanford Univ. Press, Stanford, Cal., 1962.
[2] J. R. Büchi andL. H. Landweber, Solving sequential conditions by finite state strategies,Trans. Amer. Math. Soc. 138 (1969), 295–311. · Zbl 0182.02302
[3] J. R. Büchi andL. H. Landweber, Definability in the monadic second order theory of successor,J. Symbolic Logic 34 (1969), 166–170. · Zbl 0209.02203 · doi:10.2307/2271090
[4] J. Hartmanis andR. E. Stearns, Sets of numbers defined by finite automata,Amer. Math. Monthly 74 (1967), 539–542. · Zbl 0149.01002 · doi:10.2307/2314883
[5] J. Hartmanis andS. E. Hopcroft, Structure of undecidable problems in automata theory, IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, October 1968, 327–333.
[6] R. McNaughton, Testing and generating infinite sequences by a finite automaton,Information and Control 9 (1966), 521–530. · Zbl 0212.33902 · doi:10.1016/S0019-9958(66)80013-X
[7] L. H. Landweber, Synthesis algorithms for sequential machines, Proceedings of IFIP Congress 68, to appear. · Zbl 0213.02202
[8] H. Rogers, Jr.,Theory of Recrusive Functions and Effective Computability, McGraw-Hill, New York, 1967.
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.