PAC-Learning Unambiguous k,l-NTS ≤ Languages

DOI10.1007/978-3-642-15488-1_11zbMath1291.68201OpenAlexW1890447469MaRDI QIDQ3588370

Franco M. Luque, Gabriel Infante-Lopez

Publication date: 10 September 2010

Published in: Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15488-1_11

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (5)

Beyond operator-precedence grammars and languages ⋮ Distributional Learning of Context-Free and Multiple Context-Free Grammars ⋮ Unnamed Item ⋮ Toward a theory of input-driven locally parsable languages ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples

This page was built for publication: PAC-Learning Unambiguous k,l-NTS ≤  Languages