Towards more expressive 2D deterministic automata
From MaRDI portal
Recommendations
Cites work
- A note on three-way two dimensional alternating Turing machines
- A survey of two-dimensional automata theory
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Deterministic recognizability of picture languages with Wang automata
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- scientific article; zbMATH DE number 1206599 (Why is no real title available?)
- Matrix-based complexity functions and recognizable picture languages
- Picture recognizability with automata based on Wang tiles
- Snake-Deterministic Tiling Systems
- Some properties of two-dimensional on-line tessellation acceptors
- Strategies to scan pictures with automata based on Wang tiles
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
Cited in
(6)- New operations and regular expressions for two-dimensional languages over one-letter alphabet
- A survey of two-dimensional automata theory
- Restarting automata for picture languages: a survey on recent developments
- Two-Dimensional Limited Context Restarting Automata
- Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
- Developments in Language Theory
This page was built for publication: Towards more expressive 2D deterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200067)