Chain-code pictures and collages generated by hyperedge replacement
From MaRDI portal
Publication:4645291
Cites work
- scientific article; zbMATH DE number 4062634 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 177447 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- An undecidable problem about rational sets and contour words of polyominoes
- Complexity and decidability for chain code picture languages
- Complexity and decidability for restricted classes of picture languages
- Decision problems and regular chain code picture languages
- Fractal geometry, Turing machines and divide-and-conquer recurrences
- Generating self-affine fractals by collage grammars
- Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid
- Using string languages to describe picture languages
Cited in
(8)- scientific article; zbMATH DE number 4074514 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1504823 (Why is no real title available?)
- Links
- scientific article; zbMATH DE number 165819 (Why is no real title available?)
- Leftmove-bounded picture languages
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)
