Linking theorems for tree transducers

DOI10.1016/j.jcss.2016.05.003zbMath1354.68154OpenAlexW2411990643MaRDI QIDQ2628796

Andreas Maletti, Zoltán Fülöp

Publication date: 15 July 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.05.003

zbMATH Keywords

compositionsexpressive powerlinking theoremtree transducersynchronous grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Decision problems of tree transducers with origin ⋮ Composition closure of linear extended top-down tree transducers

Uses Software

• Moses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions of extended top-down tree transducers
• Extended multi bottom-up tree transducers
• Morphismes et bimorphismes d'arbres
• Origin tracking
• Composition closure of linear weighted extended top-down tree transducers
• A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
• Linear deterministic multi bottom-up tree transducers
• Language Prototyping: An Algebraic Specification Approach
• Tree Transformations and Dependencies
• The Power of Regularity-Preserving Multi Bottom-up Tree Transducers
• Statistical Machine Translation
• Adding nesting structure to words
• The Power of Extended Top-Down Tree Transducers
• Top-down tree transducers with regular look-ahead
• Macro Tree Translations of Linear Size Increase are MSO Definable
• Transducers with Origin Information
• Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers

This page was built for publication: Linking theorems for tree transducers