Chain-code pictures and collages generated by hyperedge replacement
From MaRDI portal
Publication:4645291
DOI10.1007/3-540-61228-9_102zbMATH Open1412.68103OpenAlexW1556693404MaRDI QIDQ4645291FDOQ4645291
Authors: S. Taubenberger, Jürgen Dassow, Annegret Habel 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fractal geometry, Turing machines and divide-and-conquer recurrences
- Title not available (Why is that?)
- Complexity and decidability for chain code picture languages
- Using string languages to describe picture languages
- Decision problems and regular chain code picture languages
- Complexity and decidability for restricted classes of picture languages
- Title not available (Why is that?)
- Generating self-affine fractals by collage grammars
- An undecidable problem about rational sets and contour words of polyominoes
- Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid
Cited In (8)
- Generating pictures in string representation with P systems: the case of space-filling curves
- P systems with parallel rewriting for chain code picture languages
- Tree-based picture generation
- Title not available (Why is that?)
- Links
- Title not available (Why is that?)
- Leftmove-bounded picture languages
- Title not available (Why is that?)
This page was built for publication: Chain-code pictures and collages generated by hyperedge replacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645291)
