{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:56:58Z","timestamp":1648979818636},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,10,1]],"date-time":"1979-10-01T00:00:00Z","timestamp":307584000000},"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":12343,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979,10]]},"DOI":"10.1016\/0304-3975(79)90033-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"311-328","source":"Crossref","is-referenced-by-count":12,"title":["One-way simple multihead finite automata"],"prefix":"10.1016","volume":"9","author":[{"given":"Katsushi","family":"Inoue","sequence":"first","affiliation":[]},{"given":"Itsuo","family":"Takanami","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Nakamura","sequence":"additional","affiliation":[]},{"given":"Tadashi","family":"Ae","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90033-1_BIB1","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1147\/rd.105.0388","article-title":"On multi-head finite automata","volume":"10","author":"Rosenberg","year":"1966","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(79)90033-1_BIB2","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","article-title":"Multi-tape and multi-head pushdown automata","volume":"13","author":"Harrison","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(79)90033-1_BIB3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00288748","article-title":"On 3-head versus 2-head finite automata","volume":"4","author":"Ibarra","year":"1975","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(79)90033-1_BIB4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90033-1_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(76)90426-5","article-title":"One-way multihead writing finite automata","volume":"30","author":"Sudborough","year":"1976","journal-title":"Information and Control"},{"issue":"2","key":"10.1016\/0304-3975(79)90033-1_BIB6","first-page":"337","article-title":"K+1 heads are better than K","volume":"25","author":"Yao","year":"1978","journal-title":"J.A.C.M."},{"key":"10.1016\/0304-3975(79)90033-1_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","article-title":"A note on semilinear sets and bounded-reversal multihead pushdown automata","volume":"3","author":"Ibarra","year":"1974","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(79)90033-1_BIB8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0304-3975(76)90081-5","article-title":"Finite automata with multiplication","volume":"2","author":"Ibarra","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90033-1_BIB9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0022-0000(76)80026-8","article-title":"A useful device for showing the solvability of some decision problems","volume":"13","author":"Ibarra","year":"1976","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(79)90033-1_BIB10","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0304-3975(79)90033-1_BIB11","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(79)90033-1_BIB12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01683273","article-title":"Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages","volume":"10","author":"Galil","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(79)90033-1_BIB13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"2","author":"Fisher","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(79)90033-1_BIB14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(76)90072-4","article-title":"Remarks on the complexity of nondeterministic counter languages","volume":"1","author":"Greibach","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90033-1_BIB15","first-page":"316","article-title":"Some properties of sensing multihead automata","volume":"J60-D","author":"Inoue","year":"1977","journal-title":"Trans. IECE of Japan"},{"key":"10.1016\/0304-3975(79)90033-1_BIB16","series-title":"Tech. Rep. No. AL77-9","article-title":"Several properties on simple multihead automata and multihead automata","author":"Inoue","year":"1977"},{"key":"10.1016\/0304-3975(79)90033-1_BIB17","series-title":"Tech. Rep. No. AL77-28","article-title":"Some properties of one-way nondeterministic simple multihead finite automata and one-way nondeterministic counter machines","author":"Inoue","year":"1977"},{"key":"10.1016\/0304-3975(79)90033-1_BIB18","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0019-9958(75)80002-7","article-title":"Erasable context-free languages","volume":"29","author":"Greibach","year":"1975","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(79)90033-1_BIB19","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0022-0000(74)80058-9","article-title":"The equivalence of stack acceptors and quasi-realtime acceptors","volume":"8","author":"Ginsburg","year":"1974","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:54:42Z","timestamp":1555077282000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,10]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,10]]}},"alternative-id":["0304397579900331"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90033-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,10]]}}}