Normalization of Sequential Top-Down Tree-to-Word Transducers
From MaRDI portal
Publication:3004595
DOI10.1007/978-3-642-21254-3_28zbMath1330.68167OpenAlexW1683019983WikidataQ62047343 ScholiaQ62047343MaRDI QIDQ3004595
Grégoire Laurence, Sławek Staworko, Aurélien Lemay, Joachim Niehren, Marc 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
Related Items (3)
Equivalence of Linear Tree Transducers with Output in the Free Group ⋮ Unnamed Item ⋮ Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
This page was built for publication: Normalization of Sequential Top-Down Tree-to-Word Transducers
