SIMPLE FLAT LANGUAGES: A LEARNABLE CLASS IN THE LIMIT FROM POSITIVE DATA

DOI10.1142/S0129054199000344zbMath1319.68124OpenAlexW2053355993MaRDI QIDQ5249023

Okadome Takesi

Publication date: 29 April 2015

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

Full work available at URL: https://doi.org/10.1142/s0129054199000344

zbMATH Keywords

finite elasticityidentification of an arithmetic progressionpolynomial-time learnability in the limit from positive datasimple flat languages

Mathematics Subject Classification ID

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

Cites Work

• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Language identification in the limit

This page was built for publication: SIMPLE FLAT LANGUAGES: A LEARNABLE CLASS IN THE LIMIT FROM POSITIVE DATA