Two-dimensional models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5141495 (Why is no real title available?)
- scientific article; zbMATH DE number 4049110 (Why is no real title available?)
- scientific article; zbMATH DE number 3738961 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1206599 (Why is no real title available?)
- A CKY parser for picture grammars
- A computational model for tiling recognizable two-dimensional languages
- A stronger recognizability condition for two-dimensional languages
- A unifying approach to picture grammars
- Classes of two-dimensional languages and recognizability conditions
- Communication complexity method for measuring nondeterminism in finite automata
- Complexity of two-dimensional patterns
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Deterministic ordered restarting automata for picture languages
- Deterministic recognizability of picture languages with Wang automata
- Grammatical picture generation. A tree-based approach. With CD-ROM.
- Handbook of Graph Grammars and Computing by Graph Transformation
- Matrix-based complexity functions and recognizable picture languages
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Nondeterminism versus determinism of finite automata over directed acyclic graphs
- Perfectly quilted rectangular snake tilings
- Picture Languages: From Wang Tiles to 2D Grammars
- Picture languages with array rewriting rules
- Picture languages: tiling systems versus tile rewriting grammars.
- Proving theorems by pattern recognition I
- Recognizable picture languages and domino tiling
- Regular expressions and context-free grammars for picture languages
- Restarting automata for picture languages: a survey on recent developments
- Restarting tiling automata
- Slender Siromoney matrix languages
- Snake-Deterministic Tiling Systems
- Some properties of two-dimensional on-line tessellation acceptors
- Strategies to scan pictures with automata based on Wang tiles
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- Tile rewriting grammars and picture languages
- Two-dimensional Sgraffito automata
- Unambiguous recognizable two-dimensional languages
- Undecidability of the emptiness problem for context-free picture languages
- Weighted Picture Automata and Weighted Logics
Cited in
(10)- Recognizable vs. Regular Picture Languages
- scientific article; zbMATH DE number 1836422 (Why is no real title available?)
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
- Picture languages
- Two-dimensional models of fabrics
- scientific article; zbMATH DE number 2150293 (Why is no real title available?)
- Picture Languages: From Wang Tiles to 2D Grammars
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
- 2D oxide picture languages and their properties
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
This page was built for publication: Two-dimensional models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074211)
