{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:19:14Z","timestamp":1760368754746},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1968,12,1]],"date-time":"1968-12-01T00:00:00Z","timestamp":-34214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":16299,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1968,12]]},"DOI":"10.1016\/s0022-0000(68)80038-8","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T10:37:03Z","timestamp":1199356623000},"page":"464-467","source":"Crossref","is-referenced-by-count":5,"title":["On a characterization of the nonregular set of primes"],"prefix":"10.1016","volume":"2","author":[{"suffix":"Jr.","given":"Dennis","family":"Allen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(68)80038-8_bib1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/321328.321337","article-title":"Unrecognizable sets of numbers","volume":"13","author":"Minsky","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(68)80038-8_bib2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0022-0000(68)80038-8_bib3","volume":"Vol. 2","author":"LeVeque","year":"1956"},{"key":"10.1016\/S0022-0000(68)80038-8_bib4","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/1970558","article-title":"Complexity of finite semigroups","volume":"88","author":"Krohn","year":"1968","journal-title":"Ann. Math."},{"key":"10.1016\/S0022-0000(68)80038-8_bib5","series-title":"Algebraic Theory of Machines, Languages and Semigroups","year":"1968"},{"key":"10.1016\/S0022-0000(68)80038-8_bib6","unstructured":"J. Hartmanis and H. Shank. Two Memory bounds for the recognition of primes by automata. To appear."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000068800388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000068800388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T18:25:47Z","timestamp":1546367147000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000068800388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1968,12]]}},"alternative-id":["S0022000068800388"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(68)80038-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1968,12]]}}}