Constructive learning of context-free languages with a subpansive tree

DOI10.1007/978-3-540-45257-7_22MaRDI QIDQ2754023zbMATH OpenFDO

Authors Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata

Publication date 11 November 2001

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning trees from strings: a strong learning algorithm for some context-free grammars
• Grammatical Inference: Algorithms and Applications
• Learning context-free grammars from structural data in polynomial time
• Learning cover context-free grammars from structural data
• Learning Cover Context-Free Grammars from Structural Data

Cited in

(5)

• Polynomial time learner for inferring subclasses of internal contextual grammars with local maximum selectors
• Learning elementary formal systems with queries.
• Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
• Using contextual representations to efficiently learn context-free languages
• Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher

This page was built for publication: Constructive learning of context-free languages with a subpansive tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754023)