{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:32:21Z","timestamp":1768271541342,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1967,7,1]],"date-time":"1967-07-01T00:00:00Z","timestamp":-79056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":17120,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1967,7]]},"DOI":"10.1016\/s0019-9958(67)90353-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T01:51:40Z","timestamp":1103075500000},"page":"3-29","source":"Crossref","is-referenced-by-count":155,"title":["Algebraic automata and context-free sets"],"prefix":"10.1016","volume":"11","author":[{"given":"J.","family":"Mezei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.B.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(67)90353-1_bib1","article-title":"Mathematical theory of automata","volume":"403","author":"B\u00fcchi","year":"1960"},{"key":"10.1016\/S0019-9958(67)90353-1_bib2","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/S0019-9958(67)90353-1_bib3","first-page":"531","article-title":"Delayed-logic and finite-state machines","volume":"6","author":"Arden","year":"1961"},{"key":"10.1016\/S0019-9958(67)90353-1_bib4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0019-9958(67)90353-1_bib5","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to ALGOL","volume":"9","author":"Ginsburg","year":"1962","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0019-9958(67)90353-1_bib6","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\/S0019-9958(67)90353-1_bib7","series-title":"Generalized Finite Automata","author":"Thatcher","year":"1966"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867903531?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867903531?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:53:31Z","timestamp":1548928411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995867903531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,7]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1967,7]]}},"alternative-id":["S0019995867903531"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(67)90353-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1967,7]]}}}