Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher

DOI10.1007/978-3-642-32024-8_13zbMath1370.68151OpenAlexW1601135321MaRDI QIDQ3167310

Ryo Yoshinaka, Alexander Clark

Publication date: 2 November 2012

Published in: Formal Grammar (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32024-8_13

Mathematics Subject Classification ID

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

Related Items (3)

A Language Theoretic Approach to Syntactic Structure ⋮ Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Distributional learning of parallel multiple context-free grammars

This page was built for publication: Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher