Inferring regular languages by merging nonterminals

DOI10.1080/00207169908804778zbMath0923.68081OpenAlexW2065133650MaRDI QIDQ4240619

Erkki Maekinen

Publication date: 29 April 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804778

zbMATH Keywords

regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Inferring uniquely terminating regular languages from positive data
• The grammatical inference problem for the Szilard languages of linear grammars
• A linear-time algorithm for a special case of disjoint set union
• Finding patterns common to a set of strings
• A family of languages which is polynomial-time learnable from positive data in pitt's sense
• Worst-case Analysis of Set Union Algorithms
• Inference of Reversible Languages
• Noncounting Context-Free Languages
• Language identification in the limit