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

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

Authors: Andreas Maletti, Andreea-Teodora Nász 

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

Recommendations

• Weighted extended tree transducers
• Incomparability results for classes of polynomial tree series transformations
• Survey: Weighted extended top-down tree transducers. III. Composition
• Equational weighted tree transformations
• Input products for weighted extended top-down tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Bottom-up and top-down tree transformations— a comparison
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Weighted tree automata and tree transducers
• Tree acceptors and some of their applications
• Three hierarchies of transducers
• Hierarchies of tree series transformations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The HOM problem is decidable
• Weighted tree automata with constraints
• Hierarchies of Tree Series Transformations Revisited

This page was built for publication: Weighted bottom-up and top-down tree transformations are incomparable

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