Tree-based generation of languages of fractals
From MaRDI portal
Publication:5958129
DOI10.1016/S0304-3975(00)00280-2zbMath0983.68100MaRDI QIDQ5958129
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (7)
Branching synchronization grammars with nested tables ⋮ The generative power of delegation networks ⋮ Criteria to disprove context freeness of collage languages. ⋮ Picture deformation ⋮ GETGRATS ⋮ SELF-SIMILARITY OF SATISFIABLE BOOLEAN EXPRESSIONS DECIPHERED IN TERMS OF GRAPH DIRECTED ITERATED FUNCTION SYSTEMS ⋮ Selected Decision Problems for Square-Refinement Collage Grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine automata and related techniques for generation of complex images
- Decision problems and regular chain code picture languages
- Fundamental properties of infinite trees
- Tree transducers, L systems, and two-way machines
- \(L\)-systems and mutually recursive function systems
- Tree-based picture generation
- Generalized sequential machine maps
- Using string languages to describe picture languages
- Extension of tabled 0L-systems and languages
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Tree transducers and tree languages
- Three hierarchies of transducers
- Handbook of Graph Grammars and Computing by Graph Transformation
- Mappings and grammars on trees
This page was built for publication: Tree-based generation of languages of fractals