Learning cover context-free grammars from structural data

DOI10.7561/SACS.2014.2.253MaRDI QIDQ4621183zbMATHFDO

Authors Mircea Marin, Gabriel Istrate

Publication date 8 February 2019

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

zbMATH Keywords

automata theorygrammatical inferencestructural descriptions

Mathematics Subject Classification ID

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

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

(7)

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

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)