The generative power of delegation networks

DOI10.1016/j.ic.2015.04.005zbMath1337.68152OpenAlexW2026661166MaRDI QIDQ897662

Frank Drewes, Joost Engelfriet

Publication date: 7 December 2015

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2015.04.005

zbMATH Keywords

tree languagecontext-free tree grammarpicture generationtree grammardelegation hierarchydelegation networkIO-hierarchymacro tree transducerpath language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Cites Work

• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Parameter reduction and automata evaluation for grammar-compressed trees
• Hyperedge replacement: grammars and languages
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Macro tree transducers
• Tree transducers, L systems, and two-way machines
• The IO- and OI-hierarchies
• Context-free hypergraph grammars have the same term-generating power as attribute grammars
• Hypergrammars: An extension of macrogrammars
• A generalized approach to formal languages
• IO and OI. I
• IO and OI. II
• Decidability of the finiteness of ranges of tree transductions
• The translation power of top-down tree-to-graph transducers
• Tree-based picture generation
• Output string languages of compositions of deterministic macro tree transducers
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Closure properties of linear context-free tree languages with an application to optimality theory
• A lattice-theoretical fixpoint theorem and its applications
• A Category Theoretic View of Nondeterministic Recursive Program Schemes.
• Implementing term rewriting by jungle evaluation
• From Tree-Based Generators to Delegation Networks
• Restarting Tree Automata and Linear Context-Free Tree Languages
• Graph expressions and graph rewritings
• Bounded nesting in macro grammars
• Handbook of Graph Grammars and Computing by Graph Transformation
• Weighted Tree Automata and Tree Transducers
• Algebraic automata and context-free sets
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• Tree-based generation of languages of fractals
• 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: The generative power of delegation networks