On the learnability of shuffle ideals

MaRDI QIDQ2933851zbMATH OpenFDO

Authors Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich

Publication date 8 December 2014

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

zbMATH Keywords

regular languagessubsequencesdeterministic finite automatastatistical queriesshuffle ideals

Mathematics Subject Classification ID

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

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

Cited in

(3)

• On the learnability of shuffle ideals
• Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
• Learning a Random DFA from Uniform Strings and State Information

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)