Generating self-affine fractals by collage grammars

DOI10.1016/0304-3975(94)00118-3zbMath0874.68176OpenAlexW2088793163MaRDI QIDQ673096

S. Taubenberger, Hans-Joerg Kreowski, Annegret Habel, Frank Drewes

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00118-3

zbMATH Keywords

Sierpinski grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Criteria to disprove context-freeness of collage languages ⋮ Criteria to disprove context freeness of collage languages. ⋮ Valuations of languages, with applications to fractal geometry ⋮ Chain-code pictures and collages generated by hyperedge replacement

Cites Work

• Hyperedge replacement: grammars and languages
• Affine automata and related techniques for generation of complex images
• Decision problems and regular chain code picture languages
• Picture iteration and picture ambiguity
• Rational and affine expressions for image description
• \(L\)-systems and mutually recursive function systems
• Plex languages
• Using string languages to describe picture languages
• A formal picture description scheme as a basis for picture processing systems
• Languages of encoded line patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating self-affine fractals by collage grammars