Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses

DOI10.1007/11872436_25zbMath1158.68414OpenAlexW1856241785MaRDI QIDQ3541872

Yen Kaow Ng, Takeshi Shinohara

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_25

Mathematics Subject Classification ID

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

Related Items (1)

Learning indexed families of recursive languages from positive data: A survey

This page was built for publication: Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses