Compositions of constant weighted extended tree transducers

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

Authors: 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

compositiondecidabilitytop-down tree transducerextended tree transducerweighted tree transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Top-down tree transducers with regular look-ahead
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized sequential machine maps
• Weighted tree automata and tree transducers
• Mappings and grammars on trees
• Statistical Machine Translation
• Morphismes et bimorphismes d'arbres
• The Power of Extended Top-Down Tree Transducers
• Compositions of extended top-down tree transducers
• Tree series transformations that respect copying
• Title not available (Why is that?)
• Title not available (Why is that?)
• Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
• Title not available (Why is that?)
• Composition closure of linear weighted extended top-down tree transducers
• Survey: Weighted extended top-down tree transducers. III. Composition

Cited In (1)

• Compositions with Constant Weighted Extended Tree Transducers

Uses Software

• OpenFst

This page was built for publication: Compositions of constant weighted extended tree transducers

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