Simple flat languages: a learnable class in the limit from positive data

DOI10.1142/S0129054199000344MaRDI QIDQ5249023zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Polynomial-time identification of very simple grammars from positive data.
• Learning efficiency of very simple grammars from positive data
• Learning Efficiency of Very Simple Grammars from Positive Data
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data

Cites work

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

Cited in

(6)

• scientific article; zbMATH DE number 1670720 (Why is no real title available?)
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• Learning Efficiency of Very Simple Grammars from Positive Data
• String extension learning using lattices
• Efficient learning of tier-based strictly k-local languages
• Learning in the limit with lattice-structured hypothesis spaces

This page was built for publication: Simple flat languages: a learnable class in the limit from positive data

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