{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:35:17Z","timestamp":1648859717154},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1968,9,1]],"date-time":"1968-09-01T00:00:00Z","timestamp":-42076800000},"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":16391,"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":[[1968,9]]},"DOI":"10.1016\/s0019-9958(68)91114-5","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T01:51:40Z","timestamp":1103075500000},"page":"245-253","source":"Crossref","is-referenced-by-count":1,"title":["Some unsolvable problems on context-free languages and their application to on-line language recognizers"],"prefix":"10.1016","volume":"13","author":[{"given":"Kojiro","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(68)91114-5_bib1","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","article-title":"Derivatives of regular expressions","volume":"11","author":"Brzozowski","year":"1964","journal-title":"JACM"},{"key":"10.1016\/S0019-9958(68)91114-5_bib2","series-title":"Proc. AIEE Second Ann. Symp. Switching Circuit Theory Logical Des.","first-page":"129","article-title":"Operations on finite automata","author":"Elgot","year":"1961"},{"key":"10.1016\/S0019-9958(68)91114-5_bib3","series-title":"An Introduction to Mathematical Machine Theory","author":"Ginsburg","year":"1962"},{"key":"10.1016\/S0019-9958(68)91114-5_bib4","series-title":"The Mathematical Theory of Context-free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0019-9958(68)91114-5_bib5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/321186.321191","article-title":"Quotients of context-free languages","volume":"10","author":"Ginsburg","year":"1963","journal-title":"JACM"},{"key":"10.1016\/S0019-9958(68)91114-5_bib6","first-page":"333","article-title":"Bounded ALGOL-like languages","volume":"113","author":"Ginsburg","year":"1964","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0019-9958(68)91114-5_bib7","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(68)91114-5_bib8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/PGEC.1966.264374","article-title":"On-line Turing machine computations","volume":"EC-15","author":"Hennie","year":"1966","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0019-9958(68)91114-5_bib9","article-title":"An Efficient Recognition and Syntax-Analysis Algorithm for Context-free Languages","author":"Kasami","year":"1965","journal-title":"Report of University of Hawaii"},{"key":"10.1016\/S0019-9958(68)91114-5_bib10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0019-9958(67)80008-1","article-title":"A note on computing time for recognition of languages generated by linear grammars","volume":"10","author":"Kasami","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(68)91114-5_bib11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u201cTAG\u201d and other topics in theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Annals Math."},{"key":"10.1016\/S0019-9958(68)91114-5_bib12","first-page":"541","article-title":"Linear automation transformation","volume":"9","author":"Nerode","year":"1958"},{"key":"10.1016\/S0019-9958(68)91114-5_bib13","first-page":"264","article-title":"On the complexity of recognition algorithm of context-free languages","volume":"50","author":"Torii","year":"1967","journal-title":"J. Inst. Electron. Commun. Engs. Japan"},{"key":"10.1016\/S0019-9958(68)91114-5_bib14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","article-title":"Recognition and parsing of context-free languages in time n3","volume":"10","author":"Younger","year":"1967","journal-title":"Inform. Control"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868911145?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868911145?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:52:12Z","timestamp":1548928332000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995868911145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1968,9]]}},"alternative-id":["S0019995868911145"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(68)91114-5","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1968,9]]}}}