Three-way automata on rectangular types over a one-letter alphabet

DOI10.1016/0020-0255(85)90041-6zbMath0592.68051OpenAlexW2033612691MaRDI QIDQ1075759

E. B. Kinber

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0020-0255(85)90041-6

zbMATH Keywords

decision problems2-dimensional languagenondeterministic three-way automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

A computational model for tiling recognizable two-dimensional languages ⋮ A survey of two-dimensional automata theory ⋮ Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages ⋮ Deterministic Two-Dimensional Languages over One-Letter Alphabet ⋮ Simple picture processing based on finite automata and regular grammars ⋮ New operations and regular expressions for two-dimensional languages over one-letter alphabet ⋮ Decision problems and projection languages for restricted variants of two-dimensional automata ⋮ Deterministic and unambiguous two-dimensional languages over one-letter alphabet ⋮ A Survey on Picture-Walking Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on decision problems for three-way two-dimensional finite automata
• Two-dimensional finite automata and unacceptable functions

This page was built for publication: Three-way automata on rectangular types over a one-letter alphabet