Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples

DOI10.1007/11872436_21zbMath1158.68411OpenAlexW1530285431MaRDI QIDQ3541868

Joachim Niehren, Aurélien Lemay, Rémi Gilleron

Publication date: 27 November 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11872436_21

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Schema-Guided Induction of Monadic Queries ⋮ On the hardness of learning queries from tree structured data

This page was built for publication: Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples