On the Learnability of Shuffle Ideals

On the Learnability of Shuffle Ideals

PAC learning of unrestricted regular languages is long known to be a difficult problem. The class of shuffle ideals is a very restricted subclass of regular languages, where the shuffle ideal generated by a string u is the collection of all strings containing u as a subsequence. This fundamental lan...

Full description

Bibliographic Details
Main Authors: Eisenstat, Sarah Charmian, Angluin, Dana, Aspnes, James, Kontorovich, Aryeh
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2013
Online Access:http://hdl.handle.net/1721.1/81422
https://orcid.org/0000-0002-3182-1675

Internet

http://hdl.handle.net/1721.1/81422
https://orcid.org/0000-0002-3182-1675

Similar Items