Skip to main content
SpringerLink
Log in

Recursive ω-languages

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Google Scholar 

  2. McNaughton, R., Testing and generating infinite sequences by a finite automaton, Inf. and Control 9 (1966), 521–530

    Google Scholar 

  3. Landweber, L.H., Decision problems for ω-automata. Math. Syst. Th. 3/4 (1969), 376–384

    Google Scholar 

  4. Staiger, L., Wagner, K., Automatentheoretische und automaten-freie Charakterisierungen topologischer Klassen regulärer Folgenmengen, EIK 10 (1970) 7, 379–392

    Google Scholar 

  5. Linna, M., On ω-words and ω-computations, Ann. Univ. Turku, Ser. A 168 (1975)

    Google Scholar 

  6. Rogers, H. jr., Theory of recursive functions and Effective Computability, McGraw-Hill New York 1967

    Google Scholar 

  7. Wagner, K., Arithmetische Operatoren, Zeitschr. Math. Logik und Grundl. d. Math. 22 (1976), 553–570

    Google Scholar 

  8. Staiger, L., Wagner, K., Rekursive Folgenmengen, 1977, in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Section of Mathematics, Friedrich Schiller University, Jena, GDR

    K. Wagner & L. Staiger

Authors
  1. K. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Staiger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation