The use of tree transducers to compute translations between graph algebras

DOI10.1007/3-540-61228-9_88zbMath1412.68126OpenAlexW1516036773MaRDI QIDQ4645277

Frank Drewes

Publication date: 10 January 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_88

zbMATH Keywords

graph algebragraph grammartree transduceroperation symbolvirtual edge

Mathematics Subject Classification ID

Hypergraphs (05C65) Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Grammars and rewriting systems (68Q42)

Related Items (2)

The equivalence of bottom-up and top-down tree-to-graph transducers ⋮ Nondeterministic operations on finite relational structures

Cites Work

• Unnamed Item
• Unnamed Item
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• On tree transducers for partial functions
• The translation power of top-down tree-to-graph transducers
• A structural characterization of planar combinatorial graphs
• Graph expressions and graph rewritings
• Bottom-up and top-down tree transformations— a comparison
• Composition of top-down and bottom-up tree transductions
• Dividing a Graph into Triconnected Components

This page was built for publication: The use of tree transducers to compute translations between graph algebras