On the power of reading the whole infinite input tape

DOI10.1023/A:1009976931662zbMath0967.68099OpenAlexW4232184147MaRDI QIDQ1592928

Ludwig Staiger

Publication date: 16 January 2001

Published in: Grammars (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009976931662

zbMATH Keywords

\(\omega\)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Turing machines and related notions (03D10)

Related Items (2)

Decision problems for Turing machines ⋮ Polishness of some topologies related to word or tree automata

This page was built for publication: On the power of reading the whole infinite input tape