A Polynomial Algorithm for the Inference of Context Free Languages
From MaRDI portal
Publication:3530184
DOI10.1007/978-3-540-88009-7_3zbMath1177.68109OpenAlexW1603299012MaRDI 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
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)
Related Items
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Grammatical inference of directed acyclic graph languages with polynomial time complexity ⋮ \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity ⋮ Synthesizing context-free grammars from recurrent neural networks ⋮ Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data
This page was built for publication: A Polynomial Algorithm for the Inference of Context Free Languages