Automata with cyclic move operations for picture languages
From MaRDI portal
Publication:5223618
Recommendations
Cites work
- scientific article; zbMATH DE number 1689049 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Comparing two-dimensional one-marker automata to sgraffito automata
- Complexity of two-dimensional patterns
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Deterministic ordered restarting automata for picture languages
- Extended two-way ordered restarting automata for picture languages
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Growing context-sensitive languages and Church-Rosser languages
- Matrix-based complexity functions and recognizable picture languages
- Monotonicity of restarting automata
- New results on deterministic sgraffito automata
- One-tape, off-line Turing machine computations
- Ordered restarting automata for picture languages
- Restarting tiling automata
- Restarting tiling automata
- Scanning pictures the boustrophedon way
- Some classes of rational functions for pictures
- Two-dimensional Sgraffito automata
- Two-dimensional sgraffito automata
Cited in
(2)
This page was built for publication: Automata with cyclic move operations for picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223618)
