Rectangles and squares recognized by two-dimensional automata
From MaRDI portal
Recommendations
- New results on alternating and non-deterministic two-dimensional finite-state automata
- A common framework to recognize two-dimensional languages
- scientific article; zbMATH DE number 871248
- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
Cited in
(15)- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Problems on finite automata and the exponential time hypothesis
- Seas of squares with sizes from a \(\Pi_{1}^{0}\) set
- Decision problems and projection languages for restricted variants of two-dimensional automata
- Undecidability of the emptiness problem for context-free picture languages
- A survey on picture-walking automata
- Unambiguous recognizable two-dimensional languages
- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- On Complexity of Two Dimensional Languages Generated by Transducers
- scientific article; zbMATH DE number 1206599 (Why is no real title available?)
- Transducer generated arrays of robotic nano-arms
- scientific article; zbMATH DE number 7770057 (Why is no real title available?)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs
- Subshifts defined by nondeterministic and alternating plane-walking automata
- Non-recursive trade-offs between two-dimensional automata and grammars
This page was built for publication: Rectangles and squares recognized by two-dimensional automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894872)
