On space functions fully constructed by two-dimensional Turing machines

DOI10.1016/0020-0190(94)00228-QMaRDI QIDQ1349721zbMATH OpenFDO

Authors 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

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

Recommendations

• On space functions constructed by two-dimensional Turing machines
• scientific article; zbMATH DE number 1848283
• ZUR RAUMKOMPLIZIERTHEIT MEHRDIMENSIONALER TURING‐AUTOMATEN
• Turing machines with sublogarithmic space
• Nondeterministic Computations in Sublogarithmic Space and Space Constructibility

Cites work

• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• A survey of two-dimensional automata theory
• On space functions constructed by two-dimensional Turing machines
• Turing machines with sublogarithmic space

Cited in

(2)

• On space functions constructed by two-dimensional Turing machines
• Some results concerning two-dimensional turing machines and finite automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349721)