Compositions of constant weighted extended tree transducers

DOI10.1007/978-3-030-81508-0_6OpenAlexW3188555560MaRDI QIDQ832923

Malte Blattmann, Andreas Maletti

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_6

zbMATH Keywords

decidabilitycompositiontop-down tree transducerextended tree transducerweighted tree transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Compositions with Constant Weighted Extended Tree Transducers

Uses Software

• OpenFst

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions of extended top-down tree transducers
• Morphismes et bimorphismes d'arbres
• Tree series transformations that respect copying
• Composition closure of linear weighted extended top-down tree transducers
• Generalized sequential machine maps
• Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power
• Pushing for Weighted Tree Automata
• Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition
• Statistical Machine Translation
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• The Power of Extended Top-Down Tree Transducers
• Top-down tree transducers with regular look-ahead
• Weighted Tree Automata and Tree Transducers
• Mappings and grammars on trees