Inferring uniquely terminating regular languages from positive data

DOI10.1016/S0020-0190(97)00045-8MaRDI QIDQ287033zbMATH OpenFDO

Authors Erkki Mäkinen

Publication date 26 May 2016

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

zbMATH Keywords

formal languagesgrammatical inferenceidentification in the limitregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Recommendations

• Inferring regular languages by merging nonterminals
• A note on inferring uniquely terminating code languages
• Algorithms for learning regular expressions from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• Inferring pure context-free languages from positive data

Cites work

• 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 note on inferring uniquely terminating code languages
• Inference of Reversible Languages
• Language identification in the limit
• The grammatical inference problem for the Szilard languages of linear grammars

Cited in

(9)

• Learning Commutative Regular Languages
• Algorithms for learning regular expressions from positive data
• On the Inference of Finite State Automata from Positive and Negative Data
• Inferring pure context-free languages from positive data
• Inference of Uniquely Terminating EML
• scientific article; zbMATH DE number 2019592 (Why is no real title available?)
• Inferring regular languages by merging nonterminals
• A note on inferring uniquely terminating code languages
• Discovering unbounded unions of regular pattern languages from positive examples

This page was built for publication: Inferring uniquely terminating regular languages from positive data

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