Identification in the Limit of k,l-Substitutable Context-Free Languages

DOI10.1007/978-3-540-88009-7_21zbMath1177.68130OpenAlexW204004087MaRDI QIDQ3528426

Ryo Yoshinaka

Publication date: 16 October 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_21

Mathematics Subject Classification ID

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

Related Items (6)

Beyond operator-precedence grammars and languages ⋮ Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Unnamed Item ⋮ An elementary proof of a generalization of double Greibach normal form ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples ⋮ Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning indexed families of recursive languages from positive data: A survey
• The equivalence and inclusion problems for NTS languages
• NTS languages are deterministic and congruential
• An elementary proof of double Greibach normal form
• Learning approximately regular languages with reversible languages
• Characteristic sets for polynomial grammatical inference
• Polynomial-time identification of very simple grammars from positive data.
• Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
• PAC-Learning Unambiguous NTS Languages
• Inference of Reversible Languages
• Algorithmic Learning Theory
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Matrix Equations and Normal Forms for Context-Free Grammars
• Language identification in the limit

This page was built for publication: Identification in the Limit of k,l-Substitutable Context-Free Languages