A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines

DOI10.1016/0304-3975(83)90008-7zbMath0525.68035OpenAlexW1977614465MaRDI QIDQ593784

Hiroshi Taniguchi, Itsuo Takanami, Katsushi Inoue

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90008-7

zbMATH Keywords

square tapesthree-way tape-bounded two-dimensional Turing machinestwo-dimensional finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Three-way tape-bounded two-dimensional Turing machines
• A note on deterministic three-way tape-bounded two-dimensional Turing machines
• Some properties of two-dimensional on-line tessellation acceptors
• Unnamed Item
• Unnamed Item