Normalization of sequential top-down tree-to-word transducers

DOI10.1007/978-3-642-21254-3_28MaRDI QIDQ3004595zbMATH OpenOpenAlexWikidataFDO

Authors Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Sławomir Staworko, M. Tommasi

Publication date 3 June 2011

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/19319873/Laurence_Lemay_ET_AL_2011_Normalization_of_Sequential_Top_Down_Tree_to_Word_Transducers.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Normal form on linear tree-to-word transducers
• Earliest normal form and minimization for bottom-up tree transducers
• Minimization of deterministic bottom-up tree transducers
• Learning sequential tree-to-word transducers
• scientific article; zbMATH DE number 3972226

Cited in

(8)

• Normal form on linear tree-to-word transducers
• Deciding equivalence of linear tree-to-word transducers in polynomial time
• Breaking through the normalization barrier: a self-interpreter for F-omega
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• scientific article; zbMATH DE number 7228439 (Why is no real title available?)
• Minimization of deterministic bottom-up tree transducers
• Equivalence of Linear Tree Transducers with Output in the Free Group
• Learning sequential tree-to-word transducers

This page was built for publication: Normalization of sequential top-down tree-to-word transducers

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