A family of languages which is polynomial-time learnable from positive data in pitt's sense

DOI10.1080/00207169608804510zbMath1001.68516OpenAlexW2047419379MaRDI QIDQ2710786

Erkki Maekinen

Publication date: 19 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804510

zbMATH Keywords

computational learning theoryformal languagesSzilard languageimplicit error of predictionpolynomial-time learnability in the limit

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Inferring uniquely terminating regular languages from positive data ⋮ Inferring regular languages by merging nonterminals

Cites Work

• The grammatical inference problem for the Szilard languages of linear grammars
• Language identification in the limit
• Unnamed Item

This page was built for publication: A family of languages which is polynomial-time learnable from positive data in pitt's sense