A Polynomial Algorithm for the Inference of Context Free Languages
From MaRDI portal
Publication:3530184
DOI10.1007/978-3-540-88009-7_3zbMath1177.68109MaRDI QIDQ3530184
Amaury Habrard, Alexander Clark, Rémi Eyraud
Publication date: 16 October 2008
Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_3
68Q32: Computational learning theory
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
68T50: Natural language processing
Related Items
Grammatical inference of directed acyclic graph languages with polynomial time complexity, \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity, Efficient learning of multiple context-free languages with multidimensional substitutability from positive data, Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data