A note on decision problems for three-way two-dimensional finite automata

DOI10.1016/0020-0190(80)90151-9zbMath0454.68046OpenAlexW2026358805MaRDI QIDQ1149774

Itsuo Takanami, Katsushi Inoue

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90151-9

zbMATH Keywords

equivalence problemcontainment problememptiness problemuniverse problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (8)

Three-way automata on rectangular types over a one-letter alphabet ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ Some results concerning two-dimensional turing machines and finite automata ⋮ A survey of two-dimensional automata theory ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Decision problems and projection languages for restricted variants of two-dimensional automata ⋮ A Survey on Picture-Walking Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence problem for deterministic two-tape automata
• A note on two-dimensional finite automata
• One-way stack automata

This page was built for publication: A note on decision problems for three-way two-dimensional finite automata