Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
From MaRDI portal
Publication:3588380
DOI10.1007/978-3-642-15488-1_19zbMath1291.68211OpenAlexW1526798193MaRDI QIDQ3588380
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_19
Related Items
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 ⋮ Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
This page was built for publication: Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries