Skip to main content
Log in

On the Power of Reading the Whole Infinite Input Tape

  • Published:
Grammars

Abstract

We investigate the relationship between the classes of ω-languages accepted by Turing machines according to two types of acceptance: 1) Machines of the first type are allowed to read only a finite part of the infinite input. 2) Machines of the second type have the additional possibility to reject by not reading the whole infinite input. It is shown that machines of the second kind are more powerful than those of the first kind.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Cohen, R.S. and A.Y. Gold, ω-computations on Turing machines, Theoret. Comput. Sci. 6: 1–23, 1978.

    Google Scholar 

  • Cohen, R.S. and A.Y. Gold, On the complexity of ω-type Turing acceptors, Theoret. Comput. Sci. 10: 249–272, 1980.

    Google Scholar 

  • Engelfriet, J. and H.J. Hoogeboom, X-automata on ω-words. Theoret. Comput. Sci. 110 (1): 1–51, 1993.

    Google Scholar 

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

    Google Scholar 

  • Staiger, L. Hierarchies of recursive ω-languages. J. Inform. Process. Cybernetics EIK 22 (5/6): 219–241, 1986.

    Google Scholar 

  • Staiger, L. Kolmogorov Complexity and Hausdorff Dimension, Inform. and Comput. 103 (2): 159–194, 1993.

    Google Scholar 

  • Staiger, L. ω-languages. In: Handbook of Formal Languages, Vol. 3, G. Rozenberg and A. Salomaa editors, 339–387, Springer-Verlag, Berlin, 1997.

    Google Scholar 

  • Staiger, L. and K. Wagner, Rekursive Folgenmengen I. Zeitschr. Math. Logik u. Grundlag. Mathematik 24 (6): 523–538, 1978. (A preliminary version appeared as: K. Wagner and L. Staiger, Recursive ω-languages, in: Fundamentals of Computation Theory, M. Karpi´nski, editor, Lect. Notes Comput. Sci. 56, Springer-Verlag, Berlin, 1977, 532-537.)

    Google Scholar 

  • Thomas, W. Automata on Infinite Objects, in Handbook of Theoretical Computer Science, Vol. B, J. Van Leeuwen, editor, Elsevier, Amsterdam 133–191, 1990.

    Google Scholar 

  • Thomas, W. Languages, Automata, and Logic, in Handbook of Formal Languages, Vol. 3, G. Rozenberg and A. Salomaa, editors, 389–455, Springer-Verlag, Berlin, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Staiger, L. On the Power of Reading the Whole Infinite Input Tape. Grammars 2, 247–257 (1999). https://doi.org/10.1023/A:1009976931662

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009976931662

Navigation