Two-dimensional models
From MaRDI portal
Publication:2074211
DOI10.4171/Automata-1/9OpenAlexW4200361405MaRDI QIDQ2074211
Dora Giammarresi, Stefano Crespi Reghizzi, Violetta Lonati
Publication date: 4 February 2022
Full work available at URL: https://doi.org/10.4171/automata-1/9
Related Items (2)
Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory ⋮ Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unifying approach to picture grammars
- Deterministic ordered restarting automata for picture languages
- A computational model for tiling recognizable two-dimensional languages
- Slender Siromoney matrix languages
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Perfectly quilted rectangular snake tilings
- Some properties of two-dimensional on-line tessellation acceptors
- Complexity of two-dimensional patterns
- Nondeterminism versus determinism of finite automata over directed acyclic graphs
- Recognizable picture languages and domino tiling
- Grammatical picture generation. A tree-based approach. With CD-ROM.
- Communication complexity method for measuring nondeterminism in finite automata
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Undecidability of the emptiness problem for context-free picture languages
- A CKY parser for picture grammars
- Tile rewriting grammars and picture languages
- Picture languages: tiling systems versus tile rewriting grammars.
- Classes of two-dimensional languages and recognizability conditions
- Strategies to scan pictures with automata based on Wang tiles
- Snake-Deterministic Tiling Systems
- Restarting Automata for Picture Languages: A Survey on Recent Developments
- Proving theorems by pattern recognition I
- Unambiguous recognizable two-dimensional languages
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- Picture Languages: From Wang Tiles to 2D Grammars
- Handbook of Graph Grammars and Computing by Graph Transformation
- Regular expressions and context-free grammars for picture languages
- Two-dimensional Sgraffito automata
- RESTARTING TILING AUTOMATA
- Weighted Picture Automata and Weighted Logics
- Picture languages with array rewriting rules
This page was built for publication: Two-dimensional models
