NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES
From MaRDI portal
Publication:5704375
DOI10.1142/S012905410500339XzbMath1090.68057MaRDI QIDQ5704375
Publication date: 14 November 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- On Goedel speed-up and succinctness of language representations
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Fooling a two way automaton or one pushdown store is better than one counter for two way machines
- Relating refined space complexity classes
- Transformational methods and their application to complexity problems. Corrigenda
- On two-way multihead automata
- On the Succinctness of Different Representations of Languages
- Succinctness of Descriptions of Unambiguous Context-Free Languages