Inferring uniquely terminating regular languages from positive data

DOI10.1016/S0020-0190(97)00045-8zbMath1337.68145MaRDI QIDQ287033

Erkki Maekinen

Publication date: 26 May 2016

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

zbMATH Keywords

formal languagesregular languagesgrammatical inferenceidentification in the limit

Mathematics Subject Classification ID

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

Related Items (1)

Inferring regular languages by merging nonterminals

Cites Work

• Unnamed Item
• The grammatical inference problem for the Szilard languages of linear grammars
• 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
• Language identification in the limit

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