On the learnability of shuffle ideals

zbMATH Open1317.68083MaRDI QIDQ2933851FDOQ2933851

Sarah Eisenstat, James Aspnes, Dana Angluin, Aryeh Kontorovich

Publication date: 8 December 2014

Full work available at URL: http://jmlr.csail.mit.edu/papers/v14/angluin13a.html

Recommendations

• On the learnability of shuffle ideals
• On Shuffle Ideals
• scientific article; zbMATH DE number 2019609
• Learning regular sets from queries and counterexamples
• Characterizing PAC-learnability of semilinear sets

zbMATH Keywords

regular languagessubsequencesdeterministic finite automatastatistical queriesshuffle ideals

Mathematics Subject Classification ID

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

Cited In (2)

• Learning a Random DFA from Uniform Strings and State Information
• Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory

This page was built for publication: On the learnability of shuffle ideals

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