A note on three-dimensional finite automata

DOI10.1016/0020-0255(82)90044-5zbMath0485.68050OpenAlexW2036452250MaRDI QIDQ1164425

Katsushi Inoue, Hiroshi Taniguchi, Itsuo Takanami

Publication date: 1982

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(82)90044-5

zbMATH Keywords

simulationaccepting powersdeterministic machinesnondeterministic machinesthree-dimensional five-way Turing machinesthree-dimensional six-way finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Simulation of three-dimensional one-marker automata by five-way Turing machines ⋮ A hierarchy of random-context grammars and automata ⋮ Random context structure grammars and automata - a formal approach ⋮ Using random context structure grammars to represent chemical structures ⋮ Three-dimensional alternating Turing machines with only universal states ⋮ A note on three-dimensional alternating Turing machines with space smaller than \(\log m\)

Cites Work

• Unnamed Item
• Unnamed Item
• Three-way tape-bounded two-dimensional Turing machines
• Some properties of two-dimensional on-line tessellation acceptors
• Relationships between nondeterministic and deterministic tape complexities

This page was built for publication: A note on three-dimensional finite automata