Tree-based picture generation
From MaRDI portal
Publication:1583092
DOI10.1016/S0304-3975(00)00168-7zbMath0949.68148MaRDI QIDQ1583092
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (11)
Generalized Random Context Picture Grammars: The State of the Art ⋮ Branching synchronization grammars with nested tables ⋮ The generative power of delegation networks ⋮ Criteria to disprove context freeness of collage languages. ⋮ Transduction from trees to graphs through folding ⋮ On formal descriptions for knitting recursive patterns ⋮ GETGRATS ⋮ SELF-SIMILARITY OF SATISFIABLE BOOLEAN EXPRESSIONS DECIPHERED IN TERMS OF GRAPH DIRECTED ITERATED FUNCTION SYSTEMS ⋮ Tree-based generation of languages of fractals ⋮ Selected Decision Problems for Square-Refinement Collage Grammars ⋮ LINKS
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Tree transducers, L systems, and two-way machines
- IO and OI. I
- IO and OI. II
- Decidability of the finiteness of ranges of tree transductions
- A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
- \(L\)-systems and mutually recursive function systems
- Criteria to disprove context freeness of collage languages.
- Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid
- Generalized sequential machine maps
- Using string languages to describe picture languages
- Extension of tabled 0L-systems and languages
- Chain-code pictures and collages generated by hyperedge replacement
- Handbook of Graph Grammars and Computing by Graph Transformation
- Context-free grammars on trees
- Algebraic automata and context-free sets
- Mappings and grammars on trees
This page was built for publication: Tree-based picture generation
