A complete classification of deterministic root-to-frontier tree transformation classes

DOI10.1016/0304-3975(91)90312-PzbMath0729.68048MaRDI QIDQ807029

Sándor Vágvölgyi, Zoltán Fülöp

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

tree transformations

Mathematics Subject Classification ID

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

Related Items (3)

Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations ⋮ Compositions with superlinear deterministic top-down tree transformations ⋮ A complete description for a monoid of deterministic bottom-up tree transformation classes

Cites Work

• A complete rewriting system for a monoid of tree transformation classes
• On tree transducers for partial functions
• Generalized sequential machine maps
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Tree transducers and tree languages
• Composition of top-down and bottom-up tree transductions
• Three hierarchies of transducers
• Mappings and grammars on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete classification of deterministic root-to-frontier tree transformation classes