Weighted bottom-up and top-down tree transformations are incomparable

DOI10.1007/978-3-031-40247-0_16OpenAlexW4385705409MaRDI QIDQ6199877

Andreea-Teodora Nász, Andreas Maletti

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Hierarchies of tree series transformations
• Weighted tree automata with constraints
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• Hierarchies of Tree Series Transformations Revisited
• Bottom-up and top-down tree transformations— a comparison
• Three hierarchies of transducers
• Weighted Tree Automata and Tree Transducers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item