The grammatical inference problem for the Szilard languages of linear grammars

DOI10.1016/0020-0190(90)90074-8zbMath0704.68064OpenAlexW1975210121MaRDI QIDQ917317

Erkki Maekinen

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90074-8

zbMATH Keywords

grammatical inferenceSzilard languageset union problemlinear grammarsregular grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

Polynomial-time identification of very simple grammars from positive data., Inferring uniquely terminating regular languages from positive data, A family of languages which is polynomial-time learnable from positive data in pitt's sense, On the structural grammatical inference problem for some classes of context-free grammars, Inferring regular languages by merging nonterminals

Cites Work

• Unnamed Item
• Learning context-free grammars from structural data in polynomial time
• Learning regular sets from queries and counterexamples
• Grammatical inference for even linear languages based on control sets
• On derivation languages corresponding to context-free grammars
• Worst-case Analysis of Set Union Algorithms
• Inference of Reversible Languages
• Associate languages and derivational complexity of formal grammars and languages