Article PDF
Avoid common mistakes on your manuscript.
References
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.
J. R. Büchi andL. H. Landweber, Solving sequential conditions by finite state strategies,Trans. Amer. Math. Soc. 138 (1969), 295–311.
J. R. Büchi andL. H. Landweber, Definability in the monadic second order theory of successor,J. Symbolic Logic 34 (1969), 166–170.
J. Hartmanis andR. E. Stearns, Sets of numbers defined by finite automata,Amer. Math. Monthly 74 (1967), 539–542.
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.
R. McNaughton, Testing and generating infinite sequences by a finite automaton,Information and Control 9 (1966), 521–530.
L. H. Landweber, Synthesis algorithms for sequential machines, Proceedings of IFIP Congress 68, to appear.
H. Rogers, Jr.,Theory of Recrusive Functions and Effective Computability, McGraw-Hill, New York, 1967.
Author information
Authors and Affiliations
Additional information
This research was supported in part by a grant from the University of Wisconsin Alumni Research Foundation.
Rights and permissions
About this article
Cite this article
Landweber, L.H. Decision problems forω-automata. Math. Systems Theory 3, 376–384 (1969). https://doi.org/10.1007/BF01691063
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01691063