Inferring regular languages by merging nonterminals

DOI10.1080/00207169908804778MaRDI QIDQ4240619zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

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)

Recommendations

• Inferring uniquely terminating regular languages from positive data
• INFERENCE OF REVERSIBLE LANGUAGES
• scientific article; zbMATH DE number 2019595
• Inferring pure context-free languages from positive data

Cites work

• scientific article; zbMATH DE number 3767067 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• A family of languages which is polynomial-time learnable from positive data in pitt's sense
• A linear-time algorithm for a special case of disjoint set union
• Finding patterns common to a set of strings
• Inference of Reversible Languages
• Inferring uniquely terminating regular languages from positive data
• Language identification in the limit
• Noncounting Context-Free Languages
• The grammatical inference problem for the Szilard languages of linear grammars
• Worst-case Analysis of Set Union Algorithms

Cited in

(4)

• INFERENCE OF REVERSIBLE LANGUAGES
• Inferring uniquely terminating regular languages from positive data
• scientific article; zbMATH DE number 1670713 (Why is no real title available?)
• A note on inferring uniquely terminating code languages

This page was built for publication: Inferring regular languages by merging nonterminals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240619)