{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T03:18:30Z","timestamp":1707967110576},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1969,7,1]],"date-time":"1969-07-01T00:00:00Z","timestamp":-15897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":16088,"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":[[1969,7]]},"DOI":"10.1016\/s0019-9958(69)90651-2","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T01:51:40Z","timestamp":1103075500000},"page":"95-109","source":"Crossref","is-referenced-by-count":12,"title":["Classification of formal languages by functional binary transductions"],"prefix":"10.1016","volume":"15","author":[{"given":"K.","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(69)90651-2_bib1","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(69)90651-2_bib2","series-title":"The Mathematical Theory of Context-free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0019-9958(69)90651-2_bib3","series-title":"Conference Record of 1967 Eighth Annual Symposium on Switching and Automata Theory","first-page":"128","article-title":"Abstract families of languages","author":"Ginsburg","year":"1967"},{"key":"10.1016\/S0019-9958(69)90651-2_bib4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/321160.321167","article-title":"Operations which preserve definability in languages","volume":"10","author":"Ginsburg","year":"1963","journal-title":"JACM"},{"key":"10.1016\/S0019-9958(69)90651-2_bib5","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"JACM"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995869906512?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995869906512?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:51:36Z","timestamp":1548928296000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995869906512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,7]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1969,7]]}},"alternative-id":["S0019995869906512"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(69)90651-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1969,7]]}}}