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

DOI10.1016/0304-3975(91)90312-PzbMATH Open0729.68048MaRDI QIDQ807029FDOQ807029

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

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

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A complete description for a monoid of deterministic bottom-up tree transformation classes
• Compositions with superlinear deterministic top-down tree transformations
• Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
• Title not available (Why is that?)

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

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