Tile rewriting grammars and picture languages
From MaRDI portal
Publication:2484438
DOI10.1016/J.TCS.2005.03.041zbMATH Open1079.68047OpenAlexW2053959528MaRDI QIDQ2484438FDOQ2484438
Authors: Stefano Crespi Reghizzi, Matteo Pradella
Publication date: 1 August 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.041
Recommendations
Cites Work
Cited In (22)
- Strip tiling and regular grammars
- Pure 2D picture grammars and languages
- Picture languages generated by assembling tiles
- Expressiveness and complexity of regular pure two-dimensional context-free languages
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- Weighted picture automata and weighted logics
- On Some Classes of 2D Languages and Their Relations
- Unambiguous recognizable two-dimensional languages
- Title not available (Why is that?)
- Hypergraph automata: a theoretical model for patterned self-assembly
- Comparing necessary conditions for recognizability of two-dimensional languages
- A CKY parser for picture grammars
- Picture languages: tiling systems versus tile rewriting grammars.
- A unifying approach to picture grammars
- Terminal weighted grammars and picture description
- Title not available (Why is that?)
- Two-dimensional models
- Characterizations of recognizable picture series
- Picture Languages Generated by Assembling Tiles
- Regional Languages and Tiling: A Unifying Approach to Picture Grammars
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
- Regional hexagonal tile rewriting grammars
This page was built for publication: Tile rewriting grammars and picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484438)