PAC-Learning Unambiguous NTS Languages

DOI10.1007/11872436_6MaRDI QIDQ3541845zbMATH OpenOpenAlexFDO

Authors Alexander Clark

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

Mathematics Subject Classification ID

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

Recommendations

• PAC-learning unambiguous \(k,l \mathrm{-NTS}^{\leq}\) languages
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
• Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
• scientific article; zbMATH DE number 2019609
• Learning trees from strings: a strong learning algorithm for some context-free grammars

Cited in

(8)

• 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
• PAC-learning unambiguous \(k,l \mathrm{-NTS}^{\leq}\) languages
• Learning mildly context-sensitive languages with multidimensional substitutability from positive data
• Languages as hyperplanes: grammatical inference with string kernels
• Probabilistic learnability of context-free grammars with basic distributional properties from positive examples

This page was built for publication: PAC-Learning Unambiguous NTS Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541845)