Unambiguous recognizable two-dimensional languages
From MaRDI portal
Recommendations
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- A brief excursion inside the class of tiling recognizable two-dimensional languages
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- Tiling Recognizable Two-Dimensional Languages
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
Cites work
- scientific article; zbMATH DE number 5141495 (Why is no real title available?)
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 4020497 (Why is no real title available?)
- scientific article; zbMATH DE number 4033664 (Why is no real title available?)
- scientific article; zbMATH DE number 176754 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- Collage of two-dimensional words
- Communication complexity method for measuring nondeterminism in finite automata
- Matrix-based complexity functions and recognizable picture languages
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- New operations and regular expressions for two-dimensional languages over one-letter alphabet
- Nondeterminism versus determinism of finite automata over directed acyclic graphs
- Some properties of two-dimensional on-line tessellation acceptors
- Theory Is Forever
- Tile rewriting grammars and picture languages
- Weighted Picture Automata and Weighted Logics
Cited in
(31)- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- Recognizable vs. Regular Picture Languages
- Characterization and measure of infinite two-dimensional strong prefix codes
- Communication complexity tools on recognizable picture languages
- Unbordered pictures: properties and construction
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Prefix picture codes: a decidable class of two-dimensional codes
- Sets of pictures avoiding overlaps
- Two-dimensional codes
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- Transducer generated arrays of robotic nano-arms
- Weighted picture automata and weighted logics
- Tiling Recognizable Two-Dimensional Languages
- Snake-Deterministic Tiling Systems
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Classes of two-dimensional languages and recognizability conditions
- Framed Versus Unframed Two-Dimensional Languages
- Comparing necessary conditions for recognizability of two-dimensional languages
- Picture codes and deciphering delay
- A Nivat theorem for weighted picture automata and weighted MSO logic
- Two-dimensional comma-free and cylindric codes
- A computational model for tiling recognizable two-dimensional languages
- Two-dimensional models
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- On Complexity of Two Dimensional Languages Generated by Transducers
- Characterizations of recognizable picture series
- Structure and properties of strong prefix codes of pictures
- A Nivat theorem for weighted picture automata and weighted MSO logics
- Recognizable languages of arrows and cospans
This page was built for publication: Unambiguous recognizable two-dimensional languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431439)
