Skip to main content
SpringerLink
Log in

Logical formulas and four subclasses of ω-regular languages

  • Part II Logic And Automata
  • Conference paper
  • First Online:
Automata on Infinite Words (LITP 1984)

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

Included in the following conference series:

  • 141 Accesses

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. J. Buchi, On a decision method in restricted second-order arithmetic, Int. Congress on Logic, Methodology and Philosophy, Stanford, Calif. (1960).

    Google Scholar 

  2. S. Ellenberg, Automata, Languages, and Machines, Vol. A, Academic Press, New York (1974).

    Google Scholar 

  3. K. Kobayashi, M. Takahashi, and H. Yamasaki, Characterization of ω-regular languages by first-order formulas, Theoretical Computer Science 28 (1984) 315–327.

    Google Scholar 

  4. L. Landweber, Decisioon problems for ω-automata, Mathematical Systems Theory 3 (1969) 376–384.

    Google Scholar 

  5. L. Staiger and K. Wagner, Automatatheoretische und automatenfreie Characterisierungen topologischer Klasses regularer Folgenmengen, EIK 10 (1974) 379–392.

    Google Scholar 

  6. M. Takahashi and H. Yamasaki, A note on ω-regular languages, Theoretical Computer Science 23 (1983) 217–225.

    Google Scholar 

  7. W. Thomas, Star-free regular sets of ω-sequences, Information and Control 42 (1979) 148–156.

    Google Scholar 

  8. H. Yamasaki, M. Takahashi, and K. Kobayashi, Characterization of ω-regular languages by monadic second-order formulas (Submitted for publication, 1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Tokyo Institute of Technology, Japan

    K. Kobayashl, M. Takahashi & H. Yamasaki

Authors
  1. K. Kobayashl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Takahashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Yamasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Nivat D. Perrin

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayashl, K., Takahashi, M., Yamasaki, H. (1985). Logical formulas and four subclasses of ω-regular languages. In: Nivat, M., Perrin, D. (eds) Automata on Infinite Words. LITP 1984. Lecture Notes in Computer Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15641-0_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-15641-0_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15641-3

  • Online ISBN: 978-3-540-39505-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation