{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:32:43Z","timestamp":1648535563896},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1974,4,1]],"date-time":"1974-04-01T00:00:00Z","timestamp":134006400000},"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":14352,"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":[[1974,4]]},"DOI":"10.1016\/s0022-0000(74)80054-1","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T15:37:03Z","timestamp":1199374623000},"page":"167-189","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic multitape automata computations"],"prefix":"10.1016","volume":"8","author":[{"given":"Yoshihide","family":"Igarashi","sequence":"first","affiliation":[]},{"given":"Namio","family":"Honda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80054-1_bib1","article-title":"Grammars with time functions","author":"Book","year":"1969","journal-title":"Harvard University Report NSF-23"},{"key":"10.1016\/S0022-0000(74)80054-1_bib2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0022-0000(71)80025-9","article-title":"Time-bounded grammars and their languages","volume":"5","author":"Book","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(74)80054-1_bib3","article-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0022-0000(74)80054-1_bib4","first-page":"29","article-title":"On the complexity of derivations in immediate constituent grammars","volume":"3","author":"Gladkij","year":"1964","journal-title":"Algebra i Logika"},{"key":"10.1016\/S0022-0000(74)80054-1_bib5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/321694.321695","article-title":"Multitape AFA","volume":"19","author":"Greibach","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80054-1_bib6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/321450.321464","article-title":"Computational complexity of one-tape Turing machine computations","volume":"15","author":"Hartmanis","year":"1968","journal-title":"Assoc. Comput. Math."},{"key":"10.1016\/S0022-0000(74)80054-1_bib7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80054-1_bib8","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":"Information and Control"},{"key":"10.1016\/S0022-0000(74)80054-1_bib9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","article-title":"Two-tape simulation of multitape Turing machines","volume":"13","author":"Hennie","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80054-1_bib10","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0022-0000(74)80054-1_bib11","first-page":"114","article-title":"On the extension of Gladkij's theorem and hierarchies of languages","volume":"55D","author":"Igarashi","year":"1972","journal-title":"Trans. The Institute of Electronics and Communication Engineers of Japan"},{"key":"10.1016\/S0022-0000(74)80054-1_bib12","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/S0019-9958(69)90078-3","article-title":"A note on computing time for the recognition of context-free languages by a single-tape Turing machine","volume":"14","author":"Taniguchi","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(74)80054-1_bib13","first-page":"264","article-title":"On the complexity of recognition algorithm of contextfree languages","volume":"50","author":"Torii","year":"1967","journal-title":"Trans. The Institute of Electrical Communication Engineers of Japan"},{"key":"10.1016\/S0022-0000(74)80054-1_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":"Information and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800541?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800541?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T23:25:34Z","timestamp":1546385134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,4]]}},"alternative-id":["S0022000074800541"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80054-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,4]]}}}