PAC-Learning Unambiguous NTS Languages

DOI10.1007/11872436_6zbMath1158.68403OpenAlexW2103625560MaRDI QIDQ3541845

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) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (7)

A Language Theoretic Approach to Syntactic Structure ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ Distributional Learning of Context-Free and Multiple Context-Free Grammars ⋮ Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Identification in the Limit of k,l-Substitutable Context-Free Languages ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples ⋮ Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data

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