Learning cover context-free grammars from structural data

DOI10.7561/SACS.2014.2.253MaRDI QIDQ4621183zbMATH OpenFDO

Authors Mircea Marin, Gabriel Istrate

Publication date 8 February 2019

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7561/SACS.2014.2.253

zbMATH Keywords

automata theorygrammatical inferencestructural descriptions

Mathematics Subject Classification ID

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

Recommendations

• Learning Cover Context-Free Grammars from Structural Data
• Learning context-free grammars from structural data in polynomial time
• Efficient learning of context-free grammars from positive structural examples
• Remarks on the structural grammatical inference problem for context-free grammars
• Grammatical Inference: Algorithms and Applications

Cited in

(8)

• Efficient learning of context-free grammars from positive structural examples
• Learning deterministic context free grammars: the Omphalos competition
• scientific article; zbMATH DE number 1670729 (Why is no real title available?)
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
• Learning Cover Context-Free Grammars from Structural Data
• Canonical context-free grammars and strong learning: two approaches
• Learning of Structurally Unambiguous Probabilistic Grammars
• Learning context-free grammars from structural data in polynomial time

This page was built for publication: Learning cover context-free grammars from structural data

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