PAC-Learning Unambiguous NTS Languages
From MaRDI portal
Publication:3541845
DOI10.1007/11872436_6zbMath1158.68403MaRDI QIDQ3541845
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_6
68Q32: Computational learning theory
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
Related Items
Probabilistic learnability of context-free grammars with basic distributional properties from positive examples, Languages as hyperplanes: grammatical inference with string kernels, Efficient learning of multiple context-free languages with multidimensional substitutability from positive data, Distributional Learning of Context-Free and Multiple Context-Free Grammars, A Language Theoretic Approach to Syntactic Structure, Identification in the Limit of k,l-Substitutable Context-Free Languages, Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data