Chain-code pictures and collages generated by hyperedge replacement
From MaRDI portal
Publication:4645291
DOI10.1007/3-540-61228-9_102zbMath1412.68103OpenAlexW1556693404MaRDI QIDQ4645291
S. Taubenberger, Annegret Habel, Juergen Dassow
Publication date: 10 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61228-9_102
Related Items (4)
P Systems with Parallel Rewriting for Chain Code Picture Languages ⋮ Generating pictures in string representation with P systems: the case of space-filling curves ⋮ Leftmove-bounded picture languages ⋮ Tree-based picture generation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating self-affine fractals by collage grammars
- Decision problems and regular chain code picture languages
- An undecidable problem about rational sets and contour words of polyominoes
- Complexity and decidability for restricted classes of picture languages
- Complexity and decidability for chain code picture languages
- Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid
- Using string languages to describe picture languages
- Fractal geometry, Turing machines and divide-and-conquer recurrences
This page was built for publication: Chain-code pictures and collages generated by hyperedge replacement