{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:01:02Z","timestamp":1770753662721,"version":"3.50.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,9,17]],"date-time":"2015-09-17T00:00:00Z","timestamp":1442448000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This work is concerned with regular languages defined over large alphabets,\neither infinite or just too large to be expressed enumeratively. We define a\ngeneric model where transitions are labeled by elements of a finite partition\nof the alphabet. We then extend Angluin's L* algorithm for learning regular\nlanguages from examples for such automata. We have implemented this algorithm\nand we demonstrate its behavior where the alphabet is a subset of the natural\nor real numbers. We sketch the extension of the algorithm to a class of\nlanguages over partially ordered alphabets.<\/jats:p>","DOI":"10.2168\/lmcs-11(3:13)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:02Z","timestamp":1479735962000},"source":"Crossref","is-referenced-by-count":14,"title":["Learning Regular Languages over Large Ordered Alphabets"],"prefix":"10.46298","volume":"Volume 11, Issue 3","author":[{"given":"Irini-Eleftheria","family":"Mens","sequence":"first","affiliation":[]},{"given":"Oded","family":"Maler","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,9,17]]},"reference":[{"key":"1095:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1589\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1589\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:20Z","timestamp":1681243640000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,17]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(3:13)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1506.00482","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1506.00482","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-662-54577-5_10","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,17]]},"article-number":"1589"}}