Efficient learning of multiple context-free languages with multidimensional substitutability from positive data

DOI10.1016/j.tcs.2010.12.058zbMath1209.68305OpenAlexW2092018982MaRDI QIDQ2431429

Ryo Yoshinaka

Publication date: 14 April 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.058

zbMATH Keywords

grammatical inferencemultiple context-free grammarsmildly context-sensitive grammars

Mathematics Subject Classification ID

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

Related Items

Gold-Style Learning Theory ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ Distributional Learning of Context-Free and Multiple Context-Free Grammars ⋮ Distributional learning of parallel multiple context-free grammars ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples

Cites Work

• Unnamed Item
• Unnamed Item
• Grammatical inference: Algorithms and applications. 9th international colloquium, ICGI 2008, Saint-Malo, France, September 22--24, 2008. Proceedings
• Grammatical inference: Algorithms and applications. 8th international colloquium, ICGI 2006, Tokyo, Japan, September 20--22, 2006. Proceedings
• Iterative learning of simple external contextual languages
• On multiple context-free grammars
• Characteristic sets for polynomial grammatical inference
• Independent parallelism in finite copying parallel rewriting systems
• Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
• A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
• Identification in the Limit of k,l-Substitutable Context-Free Languages
• Iterative Learning of Simple External Contextual Languages
• A Polynomial Algorithm for the Inference of Context Free Languages
• PAC-Learning Unambiguous NTS Languages
• Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
• Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
• Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data
• Inference of Reversible Languages
• Algorithmic Learning Theory
• Grammatical Inference: Algorithms and Applications
• Language identification in the limit

This page was built for publication: Efficient learning of multiple context-free languages with multidimensional substitutability from positive data