Abstract
Finite devices accepting infinite strings are the topic of several papers (see the recent surveys [4], [8] or [10], [11]). Most of these papers deal with finite automata. Thus finite automata as devices accepting infinite strings are wellunderstood. The situation is a little bit more involved if one considers more complicated accepting devices like, e.g., pushdown automata or Turing machines.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. S. Cohen, A. Y. Gold, Theory of ω-languages I: Characterizations of ω-context-free languages, and II: A study of various models of ω-type generation and recognition, J. Comput. System sci., 15, 2 (1977), 169–184 and 185–208.
R. S. Cohen, A. Y. Gold, ω-computations on Turing machines, Theoret. Comput. sci., 6 (1978), 1–23.
R. S. Cohen, A. Y. Gold, On the complexity of ω-type Turing acceptors, Theoret. Comput. sci., 10 (1980), 249–272.
J. Engelfriet, H. J. Hoogeboom, X-automata on ω-words, Theoret. Comput. Sci, 110 (1993) 1, 1–51.
L. H. Landweber, Decision problems for ω-automata, Math. Syst. Theory, 3, 4 (1969), 376–384.
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw Hill, New York 1967.
L. Staiger, Hierarchies of recursive ω-languages, J. Inform. Process. Cybernetics, EIK, 22, 5/6 (1986), 219–241.
L. Staiger, ω-languages, in vol. 3 of Handbook of Formal Languages, (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1997, 339–387.
L. Staiger, K. Wagner, Rekursive Folgenmengen I, Zeitschr. Math. Logik u. Grundl. Mathematik, 24, 6 (1978), 523–538.
W. Thomas, Automata on infinite objects, in vol. B of Handbook of Theoretical Computer Science (J. Van Leeuwen, ed.), Elsevier, Amsterdam, 1990, 133–191.
W. Thomas, Languages, automata, and logic, in vol. 3 of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1997, 389–455.
K. Wagner, L. Staiger, Recursive ω-languages, in Fundamentals of Computation Theory, (M. Karpiński, ed.), Lecture Notes in Computer Science, 56, Springer-Verlag, Berlin 1977, 532–537.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London Limited
About this chapter
Cite this chapter
Staiger, L. (2000). On the Power of Reading the Whole Infinite Input Tape. In: Finite Versus Infinite. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0751-4_22
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0751-4_22
Publisher Name: Springer, London
Print ISBN: 978-1-85233-251-8
Online ISBN: 978-1-4471-0751-4
eBook Packages: Springer Book Archive