{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:36:11Z","timestamp":1649180171452},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"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":10152,"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":[[1985,10]]},"DOI":"10.1016\/s0019-9958(85)80029-2","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T11:12:14Z","timestamp":1115118734000},"page":"114-125","source":"Crossref","is-referenced-by-count":4,"title":["Some characterizations of multihead finite automata"],"prefix":"10.1016","volume":"67","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam M.","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(85)80029-2_bib1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(68)91087-5","article-title":"Time and tape complexity of pushdown automaton languages","volume":"13","author":"Aho","year":"1968","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(85)80029-2_bib2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0020-0190(84)90080-2","article-title":"A note on bounded-reversal multipushdown machines","volume":"19","author":"Chrobak","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0019-9958(85)80029-2_bib3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01683273","article-title":"Two-way deterministic pushdown automaton languages and some open problems in the theory of computing","volume":"10","author":"Galil","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(85)80029-2_bib4","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","article-title":"Checking automata and one-way stack languages","volume":"3","author":"Greibach","year":"1969","journal-title":"J. Comput. System Sci."},{"issue":"No. 2","key":"10.1016\/S0019-9958(85)80029-2_bib5","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0209029","article-title":"Path systems: constructions, solutions and applications","volume":"9","author":"Gurari","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"No. 8","key":"10.1016\/S0019-9958(85)80029-2_bib6","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1002\/j.1538-7305.1967.tb03172.x","article-title":"Unified theory of automata","volume":"46","author":"Hopcroft","year":"1967","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0019-9958(85)80029-2_bib7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(71)80029-6","article-title":"Characterizations of some tape and time complexity classes of Turing Machines in terms of multihead and auxiliary stack automata","volume":"5","author":"Ibarra","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(85)80029-2_bib8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","article-title":"On two-way multihead automata","volume":"7","author":"Ibarra","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(85)80029-2_bib9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0019-9958(78)90570-3","article-title":"Tape bounds for some subclasses of deterministic context-free languages","volume":"37","author":"Igarashi","year":"1978","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(85)80029-2_bib10","first-page":"338","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(85)80029-2_bib11","series-title":"Proc. 8th Annual ACM Sympos. on Theory of Computing","first-page":"141","article-title":"On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store","author":"Sudborough","year":"1976"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:55:40Z","timestamp":1548532540000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995885800292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["S0019995885800292"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(85)80029-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}