Grammatical Inference: Algorithms and Applications

DOI10.1007/B101520zbMATH Open1111.68479OpenAlexW2140613976MaRDI QIDQ5493036FDOQ5493036

Authors: Shinnosuke Seki, Satoshi Kobayashi 

Publication date: 20 October 2006

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

Full work available at URL: https://doi.org/10.1007/b101520

Recommendations

• Efficient learning of context-free grammars from positive structural examples
• Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
• Learning context-free grammars from structural data in polynomial time
• scientific article; zbMATH DE number 1670726
• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Cited In (9)

• Learning context-free grammars using tabular representations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning context-free grammars from structural data in polynomial time
• Learning context free grammars with the finite context property: a correction of A. Clark's algorithm
• On the structural grammatical inference problem for some classes of context-free grammars
• Grammatical Inference: Algorithms and Applications
• Canonical context-free grammars and strong learning: two approaches
• Learning cover context-free grammars from structural data

This page was built for publication: Grammatical Inference: Algorithms and Applications

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