{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:22:26Z","timestamp":1780050146124,"version":"3.53.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":12465,"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":[[1979,6]]},"DOI":"10.1016\/0022-0000(79)90038-2","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"304-306","source":"Crossref","is-referenced-by-count":14,"title":["Some remarks on multiple-entry finite automata"],"prefix":"10.1016","volume":"18","author":[{"given":"Paulo A.S.","family":"Veloso","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arthur","family":"Gill","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90038-2_BIB1","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/S0022-0000(76)80006-2","article-title":"A note on multiple-entry finite automata","volume":"12","author":"Galil","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90038-2_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","article-title":"Multiple-entry finite automata","volume":"9","author":"Gill","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90038-2_BIB3","series-title":"Algebraic Structure Theory of Sequential Machines","author":"Hartmanis","year":"1966"},{"key":"10.1016\/0022-0000(79)90038-2_BIB4","first-page":"93","article-title":"Homomorphisms between finite automata","volume":"10F","author":"Paz","year":"1965","journal-title":"Bull. Res. Council Israel"},{"key":"10.1016\/0022-0000(79)90038-2_BIB5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/321281.321292","article-title":"Ultimate-definite and symmetric-definite events and automata","volume":"12","author":"Paz","year":"1965","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900382?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900382?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:20:38Z","timestamp":1550319638000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0022000079900382"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90038-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}