Compositions with superlinear deterministic top-down tree transformations

DOI10.1016/S0304-3975(96)00332-5zbMath0902.68091OpenAlexW2033730273MaRDI QIDQ1127541

G. Dányi, Zoltán Fülöp

Publication date: 13 August 1998

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00332-5

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Branching synchronization grammars with nested tables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete classification of deterministic root-to-frontier tree transformation classes
• A complete rewriting system for a monoid of tree transformation classes
• A complete description for a monoid of deterministic bottom-up tree transformation classes
• Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Composition of top-down and bottom-up tree transductions
• Three hierarchies of transducers
• Superlinear deterministic top-down tree transducers
• Mappings and grammars on trees