Grammatical Inference: Algorithms and Applications

DOI10.1007/B101520MaRDI QIDQ5493036zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(9)

• scientific article; zbMATH DE number 1670726 (Why is no real title available?)
• On the structural grammatical inference problem for some classes of context-free grammars
• Learning context-free grammars from structural data in polynomial time
• Canonical context-free grammars and strong learning: two approaches
• Learning context-free grammars using tabular representations
• Learning cover context-free grammars from structural data
• Grammatical Inference: Algorithms and Applications
• scientific article; zbMATH DE number 1670729 (Why is no real title available?)
• Learning context free grammars with the finite context property: a correction of A. Clark's algorithm

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)