Three-way tape-bounded two-dimensional Turing machines
From MaRDI portal
Publication:1143793
DOI10.1016/0020-0255(79)90017-3zbMath0442.68035OpenAlexW2041054457MaRDI QIDQ1143793
Katsushi Inoue, Itsuo Takanami
Publication date: 1979
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(79)90017-3
Related Items (19)
Three-way two-dimensional finite automata with rotated inputs ⋮ A survey of two-dimensional automata theory ⋮ A note on three-way two dimensional alternating Turing machines ⋮ A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines ⋮ On three-way two-dimensional Turing machines ⋮ Three-dimensional alternating Turing machines with only universal states ⋮ Closure properties of three-way and four-way tape-bounded two-dimensional Turing machines ⋮ Three-way two-dimensional multicounter automata ⋮ A note on deterministic three-way tape-bounded two-dimensional Turing machines ⋮ Two-dimensional automata with rotated inputs ⋮ A note on three-dimensional finite automata ⋮ Some remarks on two-dimensional finite automata ⋮ Simple picture processing based on finite automata and regular grammars ⋮ A Survey on Picture-Walking Automata ⋮ A leaf-time hierarchy of two-dimensional alternating turing machines ⋮ Two-dimensional alternative Turing machines ⋮ A space-hierarchy result on two-dimensional alternating Turing machines with only universal states ⋮ Two-dimensional automata with rotated inputs (projection-type) ⋮ Degrees of restriction for two-dimensional automata
Cites Work
- Unnamed Item
- A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines
- Cyclic closure properties of automata on a two-dimensional tape
- Closure properties of three-way and four-way tape-bounded two-dimensional Turing machines
- Some properties of two-dimensional on-line tessellation acceptors
- One-Pass Complexity of Digital Picture Properties
- Picture languages with array rewriting rules
This page was built for publication: Three-way tape-bounded two-dimensional Turing machines
