Skip to main content
SpringerLink
Log in

Acceptance of ω-Languages by Communicating Deterministic Turing Machines

  • Chapter
Where Mathematics, Computer Science, Linguistics and Biology Meet

Abstract

Using a specific model of communicating deterministic Turing machines we prove that the class of ω-languages accepted by deterministic Turing machines via complete non-oscillating (complete oscillating) runs on the input coincides with the class of ∏3-definable (Σ3-definable, respectively) ω-languages.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohen, R.S. & A. Y. Gold (1977), Theory of ω-languages I: Characterizations of ω-context-free languages, and II: A study of various models of ω-type generation and recognition, Journal of Computer and System Sciences, 15.2: 169–184, 185-208.

    Article  MathSciNet  MATH  Google Scholar 

  2. Cohen, R.S. & A. Y. Gold (1978), ω-computations on Turing machines, Theoretical Computer Science, 6: 1–23.

    Article  MathSciNet  MATH  Google Scholar 

  3. Cohen, R.S. & A. Y. Gold (1980), On the complexity of ω-type Turing acceptors, Theoretical Computer Science, 10: 249–272.

    Article  MathSciNet  MATH  Google Scholar 

  4. Engelfriet, J. & H.J. Hoogeboom (1993), X-automata on ω-words, Theoretical Computer Science, 110.1: 1–51.

    Article  MathSciNet  MATH  Google Scholar 

  5. Freund, R. & L. Staiger (1996), Numbers defined by Turing machines, Collegium Logicum (Annals of the Kurt-Gödel-Society), II: 118-137. Springer, Wien.

    Google Scholar 

  6. Landweber, L.H. (1969), Decision problems for ω-automata, Mathematical Systems Theory, 3.4: 376–384.

    Article  MathSciNet  MATH  Google Scholar 

  7. Minsky, M.L. (1971), Berechnung: Endliche und unendliche Maschinen, Berliner Union, Stuttgart.

    MATH  Google Scholar 

  8. Rogers, H. (1967), Theory of Recursive Functions and Effective Computability, McGraw Hill, New York.

    MATH  Google Scholar 

  9. Staiger, L. (1986), Hierarchies of recursive ω-languages, Journal of Information Processing and Cybernetics EIK, 22.5/6: 219–241.

    MathSciNet  Google Scholar 

  10. Staiger, L. (1997), ω-languages, in G. Rozenberg & A. Salomaa, eds., Handbook of Formal Languages, III: 339–387. Springer, Berlin.

    Chapter  Google Scholar 

  11. Staiger, L. (1999), On the power of reading the whole infinite input tape, Grammars, 2.3: 247–257.

    Article  MathSciNet  MATH  Google Scholar 

  12. Staiger, L. & K. Wagner (1978), Rekursive Folgenmengen I, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 24.6: 523–538.

    Article  MathSciNet  MATH  Google Scholar 

  13. Thomas, W. (1990), Automata on infinite objects, in J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, B: 133–191, Elsevier, Amsterdam.

    Google Scholar 

  14. Thomas, W. (1997), Languages, automata, and logic, in G. Rozenberg & A. Salomaa, eds., Handbook of Formal Languages, III: 389–455. Springer, Berlin.

    Chapter  Google Scholar 

  15. Wagner, K. & L. Staiger (1977), Recursive ω-languages, in Fundamentals of Computation Theory: 532–537. Springer, Berlin.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Languages, Technical University of Wien, Karlsplatz 13, A-1040, Wien, Austria

    Rudolf Freund

  2. Institute of Informatics, Martin-Luther- University at Halle- Wittenberg, Kurt-Mothes-Str. 1, D-06120, Halle (Saale), Germany

    Ludwig Staiger

Authors
  1. Rudolf Freund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ludwig Staiger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  2. University of Bucharest, Bucharest, Romania

    Victor Mitrana

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Freund, R., Staiger, L. (2001). Acceptance of ω-Languages by Communicating Deterministic Turing Machines. In: Martín-Vide, C., Mitrana, V. (eds) Where Mathematics, Computer Science, Linguistics and Biology Meet. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9634-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9634-3_10

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5607-8

  • Online ISBN: 978-94-015-9634-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation