Criteria to disprove context freeness of collage languages.

DOI10.1016/S0304-3975(02)00049-XzbMath1044.68089OpenAlexW1975519986MaRDI QIDQ1401171

Denis Lapoire, Frank Drewes, Hans-Joerg Kreowski

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00049-x

zbMATH Keywords

collage grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Criteria to disprove context freeness of collage languages. ⋮ GETGRATS ⋮ LINKS ⋮ Tree-based picture generation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating self-affine fractals by collage grammars
• Hyperedge replacement: grammars and languages
• On the quadratic mapping \(z\rightarrow z^{2}-\mu \) for complex \(\mu \) and \(z\): the fractal structure of its set, and scaling
• Criteria to disprove context freeness of collage languages.
• Tree-based picture generation
• Rational sets in commutative monoids
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Tree-based generation of languages of fractals

This page was built for publication: Criteria to disprove context freeness of collage languages.