Learning Sequential Tree-to-Word Transducers

DOI10.1007/978-3-319-04921-2_40zbMath1407.68262OpenAlexW1921404173WikidataQ62047331 ScholiaQ62047331MaRDI QIDQ5404938

Joachim Niehren, Grégoire Laurence, Aurélien Lemay, Sławek Staworko, Marc Tommasi

Publication date: 31 March 2014

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/19314071/Lawrence_Lemay_ET_AL_2014_Learning_Sequential_Tree_to_Word_Transducers.pdf

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (2)

Equivalence of Linear Tree Transducers with Output in the Free Group ⋮ Unnamed Item

This page was built for publication: Learning Sequential Tree-to-Word Transducers