Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data

DOI10.1007/978-3-642-04414-4_24zbMath1262.68074OpenAlexW1846153761MaRDI QIDQ3648758

Ryo Yoshinaka

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04414-4_24

Mathematics Subject Classification ID

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

Related Items (3)

A Language Theoretic Approach to Syntactic Structure ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ Efficient learning of multiple context-free languages with multidimensional substitutability from positive data

Cites Work

• 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
• On multiple context-free grammars
• Characteristic sets for polynomial grammatical inference
• Independent parallelism in finite copying parallel rewriting systems
• 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
• Inference of Reversible Languages
• Algorithmic Learning Theory
• Grammatical Inference: Algorithms and Applications
• Language identification in the limit

This page was built for publication: Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data