On the Power of Reading the Whole Infinite Input Tape
Finite devices accepting infinite strings are the topic of several papers (see the recent surveys ,  or , ). 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.
Unable to display preview. Download preview PDF.
- W. Thomas, Automata on infinite objects, in vol. B of Handbook of Theoretical Computer Science (J. Van Leeuwen, ed.), Elsevier, Amsterdam, 1990, 133–191.Google Scholar
- 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.Google Scholar