Inferring uniquely terminating regular languages from positive data

DOI10.1016/S0020-0190(97)00045-8zbMATH Open1337.68145MaRDI QIDQ287033FDOQ287033

Authors: Erkki Mäkinen 

Publication date: 26 May 2016

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

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

zbMATH Keywords

formal languagesgrammatical inferenceidentification in the limitregular languages

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Language identification in the limit
• A note on inferring uniquely terminating code languages
• A family of languages which is polynomial-time learnable from positive data in pitt's sense
• Inference of Reversible Languages
• The grammatical inference problem for the Szilard languages of linear grammars

Cited In (9)

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

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)