A note on two-dimensional finite automata

DOI10.1016/0020-0190(78)90040-6zbMath0374.94036OpenAlexW2153439182MaRDI QIDQ1245102

K. Appert

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90040-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Concatenation operations and restricted variants of two-dimensional automata ⋮ A hierarchy of random-context grammars and automata ⋮ A computational model for tiling recognizable two-dimensional languages ⋮ Random context structure grammars and automata - a formal approach ⋮ A survey of two-dimensional automata theory ⋮ A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines ⋮ Cyclic closure properties of automata on a two-dimensional tape ⋮ A note on deterministic three-way tape-bounded two-dimensional Turing machines ⋮ Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure ⋮ A note on decision problems for three-way two-dimensional finite automata ⋮ A note on time-bounded bottom-up pyramid cellular acceptors ⋮ New operations and regular expressions for two-dimensional languages over one-letter alphabet ⋮ A NOTE ON REBOUND TURING MACHINES ⋮ Probabilistic rebound Turing machines ⋮ A note on bottom-up pyramid acceptors ⋮ A note on two-dimensional probabilistic Turing machines ⋮ A note on two-dimensional probabilistic finite automata ⋮ Non-closure property of space-bounded two-dimensional alternating Turing machines

Cites Work

• Some properties of two-dimensional on-line tessellation acceptors
• Picture languages with array rewriting rules
• Unnamed Item
• Unnamed Item
• Unnamed Item

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