On space functions fully constructed by two-dimensional Turing machines

DOI10.1016/0020-0190(94)00228-QzbMath1023.68620MaRDI QIDQ1349721

O. Diekmann

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

Some results concerning two-dimensional turing machines and finite automata

Cites Work

• On space functions constructed by two-dimensional Turing machines
• Turing machines with sublogarithmic space
• A survey of two-dimensional automata theory
• Unnamed Item

This page was built for publication: On space functions fully constructed by two-dimensional Turing machines