Graph grammars and tree transducers

DOI10.1007/BFB0017471MaRDI QIDQ4954439zbMATH OpenFDO

Authors Joost Engelfriet

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017471

Mathematics Subject Classification ID

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

Recommendations

• Tree languages generated by context-free graph grammars
• On the generation of trees by hyperedge replacement
• The use of tree transducers to compute translations between graph algebras
• The translation power of top-down tree-to-graph transducers

Cited in

(46)

• Macro tree transducers
• Alternating tree automata
• Weighted grammars and Kleene's theorem
• Tree transducers, L systems, and two-way machines
• The IO- and OI-hierarchies
• Systolic trees and systolic language recognition by tree automata
• Computation graphs for actor grammars
• Problem in graph theory
• Decidability of the finiteness of ranges of tree transductions
• Nondeterministic operations on finite relational structures
• The generating power of total deterministic tree transducers
• Stochastically costed tree automata: Turakainen's theorem
• Logical description of context-free graph languages
• Tree-based picture generation
• The evaluation of first-order substitution is monadic second-order compatible
• Tree-to-graph transductions with scope
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• Weighted parsing for grammar-based language models over multioperator monoids
• Linear weighted tree automata with storage and inverse linear tree homomorphisms
• Formalising and implementing Boost POSIX regular expression matching
• Constructing small tree grammars and small circuits for formulas
• Multi-Component Tree Insertion Grammars
• scientific article; zbMATH DE number 1819630 (Why is no real title available?)
• Arbology: trees and pushdown automata
• scientific article; zbMATH DE number 4035184 (Why is no real title available?)
• scientific article; zbMATH DE number 4049095 (Why is no real title available?)
• scientific article; zbMATH DE number 4062633 (Why is no real title available?)
• scientific article; zbMATH DE number 165817 (Why is no real title available?)
• scientific article; zbMATH DE number 176239 (Why is no real title available?)
• scientific article; zbMATH DE number 177434 (Why is no real title available?)
• scientific article; zbMATH DE number 1089086 (Why is no real title available?)
• Tree languages generated by context-free graph grammars
• scientific article; zbMATH DE number 6819816 (Why is no real title available?)
• The use of tree transducers to compute translations between graph algebras
• Concatenation of graphs
• scientific article; zbMATH DE number 3999315 (Why is no real title available?)
• scientific article; zbMATH DE number 919849 (Why is no real title available?)
• Designing and Learning Substitutable Plane Graph Grammars
• Multiscale graph grammars can generate Cayley graphs of groups and monoids
• Translating controlled graph grammars to ordinary graph grammars
• Lectures on Concurrency and Petri Nets
• Automata on infinite objects and their applications to logic and programming
• Hybrid tree automata and the yield theorem for constituent tree automata
• On the power of local graph expansion grammars with and without additional restrictions
• On categorical graph grammars integrating structural transformations and operations on labels
• Modular tree transducers

This page was built for publication: Graph grammars and tree transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954439)