Inferring regular languages by merging nonterminals

DOI10.1080/00207169908804778zbMATH Open0923.68081OpenAlexW2065133650MaRDI QIDQ4240619FDOQ4240619

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

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

zbMATH Keywords

regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Language identification in the limit
• 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
• Inferring uniquely terminating regular languages from positive data
• Worst-case Analysis of Set Union Algorithms
• Inference of Reversible Languages
• The grammatical inference problem for the Szilard languages of linear grammars
• Title not available (Why is that?)
• Noncounting Context-Free Languages

Cited In (4)

• INFERENCE OF REVERSIBLE LANGUAGES
• Inferring uniquely terminating regular languages from positive data
• Title not available (Why is that?)
• 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)