On the structural grammatical inference problem for some classes of context-free grammars

DOI10.1016/0020-0190(92)90124-EzbMath0779.68053MaRDI QIDQ1198013

Erkki Maekinen

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmstime complexityinvertible grammarsreversible context-free grammarstructural grammatical inference problem for reversible grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Data structures (68P05)

Related Items (3)

Recent advances of grammatical inference ⋮ Grammatical inference: An old and new paradigm ⋮ Remarks on the structural grammatical inference problem for context-free grammars

Cites Work

• Unnamed Item
• Unnamed Item
• The grammatical inference problem for the Szilard languages of linear grammars
• Learning context-free grammars from structural data in polynomial time
• Efficient learning of context-free grammars from positive structural examples
• Worst-case Analysis of Set Union Algorithms
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages

This page was built for publication: On the structural grammatical inference problem for some classes of context-free grammars