Two-dimensional finite automata and unacceptable functions

DOI10.1080/00207167908803172zbMath0415.68022OpenAlexW1987999044MaRDI QIDQ3051389

No author found.

Publication date: 1979

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167908803172

zbMATH Keywords

two-dimensional languagestwo-dimensional finite automataacceptance of integer functionstwo-way two-tape finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Three-way automata on rectangular types over a one-letter alphabet ⋮ A survey of two-dimensional automata theory ⋮ Functions realizable by one-dimensional iterative systems ⋮ Deterministic Two-Dimensional Languages over One-Letter Alphabet ⋮ New operations and regular expressions for two-dimensional languages over one-letter alphabet ⋮ Deterministic and unambiguous two-dimensional languages over one-letter alphabet

Cites Work

• Hierarchies of Turing machines with restricted tape alphabet size
• On two-way multihead automata
• Finite Automata and the Set of Squares

This page was built for publication: Two-dimensional finite automata and unacceptable functions