{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:17Z","timestamp":1720201097075},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90048-9","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"291-308","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Alternating simple multihead finite automata"],"prefix":"10.1016","volume":"36","author":[{"given":"Hiroshi","family":"Matsuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsushi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Taniguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itsuo","family":"Takanami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90048-9_BIB1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90048-9_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(83)90096-8","article-title":"One-way simple multihead finite automata are not closed under concatenation","volume":"27","author":"\u010euri\u0161","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90048-9_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01786980","article-title":"(Semi) Alternating stack automata","volume":"15","author":"Gurari","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(85)90048-9_BIB4","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(85)90048-9_BIB5","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(85)90048-9_BIB6","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\/0304-3975(85)90048-9_BIB7","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(85)90048-9_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(85)90048-9_BIB9","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(79)90033-1","article-title":"One-way simple multihead finite automata","volume":"9","author":"Inoue","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90048-9_BIB10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(83)90093-2","article-title":"Two-dimensional alternating Turing machines","volume":"27","author":"Inoue","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90048-9_BIB11","first-page":"25","article-title":"Semi-one-way simple multihead finite automata","volume":"J63-D","author":"Inoue","year":"1980","journal-title":"Trans. IECE of Japan"},{"key":"10.1016\/0304-3975(85)90048-9_BIB12","series-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing","first-page":"189","article-title":"Measures of parallelism in alternating computation trees","author":"King","year":"1981"},{"key":"10.1016\/0304-3975(85)90048-9_BIB13","series-title":"Automata, Languages and Programming, 8th Colloquium","first-page":"506","article-title":"Alternating multihead finite automata","volume":"115","author":"King","year":"1981"},{"key":"10.1016\/0304-3975(85)90048-9_BIB14","series-title":"Conf. Rec. IEEE 19th Ann. Symp. on Foundations of Computer Science","first-page":"92","article-title":"Alternating pushdown automata","author":"Ladner","year":"1978"},{"key":"10.1016\/0304-3975(85)90048-9_BIB15","series-title":"Tech. Rept. No. AL82-17","article-title":"One-dimensional alternating simple multihead finite automata","author":"Matsuno","year":"1982"},{"key":"10.1016\/0304-3975(85)90048-9_BIB16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00264255","article-title":"On alternation","volume":"14","author":"Paul","year":"1980","journal-title":"Acta Informatica"},{"key":"10.1016\/0304-3975(85)90048-9_BIB17","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","article-title":"Tree-size bounded alternation","volume":"21","author":"Ruzzo","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90048-9_BIB18","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(85)90048-9_BIB19","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"},{"key":"10.1016\/0304-3975(85)90048-9_BIB20","series-title":"Conf. Rec. IEEE 21st Ann. Symp. on Foundations of Computer Science","first-page":"62","article-title":"Efficient algorithms for path system problems and applications to alternating time-space complexity classes","author":"Sudborough","year":"1980"},{"key":"10.1016\/0304-3975(85)90048-9_BIB21","series-title":"Tech. Rept. No. AL78-64","article-title":"Some classes of simple multihead finite automata","author":"Taniguchi","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900489?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900489?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:52:57Z","timestamp":1553187177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":21,"alternative-id":["0304397585900489"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90048-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}