Preview
Unable to display preview. Download preview PDF.
References
Büchi, J.R., On a decision method in restricted secondorder arithmetic, Proc. Int. Congr. on Logic, Meth. and Phil. of Sc. 1960, Stanford Univ. Press, Stanford, California
McNaughton, R., Testing and generating infinite sequences by a finite automaton, Inf. and Control 9 (1966), 521–530
Landweber, L.H., Decision problems for ω-automata. Math. Syst. Th. 3/4 (1969), 376–384
Staiger, L., Wagner, K., Automatentheoretische und automaten-freie Charakterisierungen topologischer Klassen regulärer Folgenmengen, EIK 10 (1970) 7, 379–392
Linna, M., On ω-words and ω-computations, Ann. Univ. Turku, Ser. A 168 (1975)
Rogers, H. jr., Theory of recursive functions and Effective Computability, McGraw-Hill New York 1967
Wagner, K., Arithmetische Operatoren, Zeitschr. Math. Logik und Grundl. d. Math. 22 (1976), 553–570
Staiger, L., Wagner, K., Rekursive Folgenmengen, 1977, in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wagner, K., Staiger, L. (1977). Recursive ω-languages. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_125
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_125
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive