Learning cover context-free grammars from structural data

DOI10.7561/SACS.2014.2.253zbMATH Open1424.68079MaRDI QIDQ4621183FDOQ4621183

Authors: Mircea Marin, Gabriel Istrate 

Publication date: 8 February 2019

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

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

zbMATH Keywords

automata theorygrammatical inferencestructural descriptions

Mathematics Subject Classification ID

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

Cited In (6)

• Learning Cover Context-Free Grammars from Structural Data
• Title not available (Why is that?)
• Learning context-free grammars from structural data in polynomial time
• Learning deterministic context free grammars: the Omphalos competition
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
• Canonical context-free grammars and strong learning: two approaches

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)