Two-dimensional finite automata and unacceptable functions

DOI10.1080/00207167908803172MaRDI QIDQ3051389zbMATH OpenOpenAlexFDO

Authors

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

acceptance of integer functionstwo-dimensional finite automatatwo-dimensional languagestwo-way two-tape finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

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

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3051389)