Matrix-based complexity functions and recognizable picture languages
From MaRDI portal
Recommendations
- Communication complexity tools on recognizable picture languages
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- Classes of two-dimensional languages and recognizability conditions
- scientific article; zbMATH DE number 871248
- Recognizable vs. Regular Picture Languages
Cited in
(30)- Networks of picture processors as problem solvers
- Two techniques in the area of the star problem in trace monoids
- Decision problems and projection languages for restricted variants of two-dimensional automata
- Two-dimensional models
- Two-dimensional codes
- Communication complexity tools on recognizable picture languages
- Satisfiability via smooth pictures
- Some classes of rational functions for pictures
- Structure and properties of strong prefix codes of pictures
- Classes of two-dimensional languages and recognizability conditions
- Strategies to scan pictures with automata based on Wang tiles
- Comparing necessary conditions for recognizability of two-dimensional languages
- Snake-Deterministic Tiling Systems
- Unambiguous recognizable two-dimensional languages
- Recognizable vs. Regular Picture Languages
- Framed Versus Unframed Two-Dimensional Languages
- On Complexity of Two Dimensional Languages Generated by Transducers
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- scientific article; zbMATH DE number 1206599 (Why is no real title available?)
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- P system generating triangular pictures
- Second-Order Finite Automata
- Towards more expressive 2D deterministic automata
- Sets of pictures avoiding overlaps
- Automata with cyclic move operations for picture languages
- Two-dimensional Sgraffito automata
- Parallel contextual array insertion-deletion P systems and array rewriting P systems with pure 2D context-free rules
- Two-dimensional context-free grid grammars
- Leader election on two-dimensional periodic cellular automata
- Complexity and decidability for restricted classes of picture languages
This page was built for publication: Matrix-based complexity functions and recognizable picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086926)
