String extension learning using lattices

DOI10.1007/978-3-642-13089-2_32MaRDI QIDQ3564879zbMATH OpenOpenAlexFDO

Authors Anna Kasprzik, Timo Kötzing

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13089-2_32

Mathematics Subject Classification ID

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

Recommendations

• Learning in the limit with lattice-structured hypothesis spaces
• A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
• Simple flat languages: a learnable class in the limit from positive data
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• scientific article; zbMATH DE number 2019595

Cited in

(5)

• scientific article; zbMATH DE number 6999908 (Why is no real title available?)
• Learning in the limit with lattice-structured hypothesis spaces
• scientific article; zbMATH DE number 2019597 (Why is no real title available?)
• Inferring Strings from Lyndon Factorization
• Learning families of closed sets in matroids

This page was built for publication: String extension learning using lattices

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