{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T23:09:29Z","timestamp":1781737769180,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642028816","type":"print"},{"value":"9783642028823","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_19","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"178-191","source":"Crossref","is-referenced-by-count":7,"title":["Three New Algorithms for Regular Language Enumeration"],"prefix":"10.1007","author":[{"given":"Margareta","family":"Ackerman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erkki","family":"M\u00e4kinen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Theoretical Computer Science","volume-title":"Efficient enumeration of words in regular languages","author":"M. Ackerman","year":"2009","unstructured":"Ackerman, M., Shallit, J.: Efficient enumeration of words in regular languages. Theoretical Computer Science. Elsevier, Amsterdam (2009)"},{"key":"19_CR2","unstructured":"Anderson, T., Rampersad, N., Santean, N., Shallit, J.: Finite automata, palindromes, patterns, and borders. In: CoRR, abs\/0711.3183 (2007)"},{"key":"19_CR3","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"key":"19_CR4","unstructured":"University of Western Ontario, Department of Computer Science: Grail+ (December 2008), \n                    \n                      http:\/\/www.csd.uwo.ca\/Research\/grail\/index.html"},{"key":"19_CR5","first-page":"55","volume":"13","author":"E. M\u00e4kinen","year":"1997","unstructured":"M\u00e4kinen, E.: On lexicographic enumeration of regular and context-free languages. Acta Cybernet.\u00a013, 55\u201361 (1997)","journal-title":"Acta Cybernet."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T03:22:31Z","timestamp":1552101751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}