{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T18:41:00Z","timestamp":1726512060708},"reference-count":6,"publisher":"Elsevier BV","issue":"37","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,28]],"date-time":"2013-09-28T00:00:00Z","timestamp":1380326400000},"content-version":"vor","delay-in-days":1488,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1016\/j.tcs.2009.03.018","type":"journal-article","created":{"date-parts":[[2009,3,26]],"date-time":"2009-03-26T09:19:29Z","timestamp":1238059169000},"page":"3461-3470","source":"Crossref","is-referenced-by-count":13,"title":["Efficient enumeration of words in regular languages"],"prefix":"10.1016","volume":"410","author":[{"given":"Margareta","family":"Ackerman","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1971","series-title":"Regular Algebra and Finite Machines","author":"Conway","key":"10.1016\/j.tcs.2009.03.018_b1"},{"issue":"3","key":"10.1016\/j.tcs.2009.03.018_b2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/j.tcs.2009.03.018_b3","unstructured":"http:\/\/www.csd.uwo.ca\/Research\/grail\/index.htmlDepartment of Computer Science, University of Western Ontario, Canada"},{"key":"10.1016\/j.tcs.2009.03.018_b4","first-page":"55","article-title":"On lexicographic enumeration of regular and context-free languages","volume":"13","author":"M\u00e4kinen","year":"1997","journal-title":"Acta Cybernet."},{"article-title":"Combinatorial algorithms. For computers and calculators","year":"1978","series-title":"Computer Science and Applied Mathematics","author":"Nijenhuis","key":"10.1016\/j.tcs.2009.03.018_b5"},{"key":"10.1016\/j.tcs.2009.03.018_b6","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397509002345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397509002345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T21:53:06Z","timestamp":1545342786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397509002345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":6,"journal-issue":{"issue":"37","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["S0304397509002345"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2009.03.018","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}