{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:13:59Z","timestamp":1649024039085},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":11248,"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":[[1982,10]]},"DOI":"10.1016\/s0019-9958(82)90572-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"193-221","source":"Crossref","is-referenced-by-count":27,"title":["Two-dimensional alternating turing machines with only universal states"],"prefix":"10.1016","volume":"55","author":[{"given":"Akira","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsushi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itsuo","family":"Takanami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Taniguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(82)90572-1_bib1","series-title":"IEEE Symposium of Switching and Automata Theory","first-page":"155","article-title":"Automata on a two-dimensional tape","author":"Blum","year":"1967"},{"issue":"1","key":"10.1016\/S0019-9958(82)90572-1_bib2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(82)90572-1_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"},{"issue":"1","key":"10.1016\/S0019-9958(82)90572-1_bib4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"16","author":"Hopcroft","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(82)90572-1_bib5","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0019-9958(82)90572-1_bib6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","article-title":"Some properties of two-dimensional on-line tessellation acceptors","volume":"13","author":"Inoue","year":"1977","journal-title":"Inform. Sci."},{"key":"10.1016\/S0019-9958(82)90572-1_bib7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0020-0255(78)90004-X","article-title":"A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional Turing machines","volume":"15","author":"Inoue","year":"1978","journal-title":"Inform. Sci."},{"key":"10.1016\/S0019-9958(82)90572-1_bib8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0255(79)90017-3","article-title":"Three-way tape-bounded two-dimensional Turing machines","volume":"17","author":"Inoue","year":"1979","journal-title":"Inform. Sci."},{"key":"10.1016\/S0019-9958(82)90572-1_bib9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0255(80)90023-7","article-title":"A note on deterministic three-way tape-bounded two-dimensional Turing machines","volume":"20","author":"Inoue","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/S0019-9958(82)90572-1_bib10","series-title":"Proceedings, 14th Ann. ACM Symp. on Theory of Computing","first-page":"37","article-title":"Two-dimensional alternating Turing machines","author":"Inoue","year":"1982"},{"key":"10.1016\/S0019-9958(82)90572-1_bib11","doi-asserted-by":"crossref","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\/S0019-9958(82)90572-1_bib12","series-title":"Lecture Notes in Computer Science 115","first-page":"506","article-title":"Alternating multihead finite automata","author":"King","year":"1980"},{"key":"10.1016\/S0019-9958(82)90572-1_bib13","series-title":"Proceedings, 13th Ann. ACM Symp. on Theory of Computing","first-page":"189","article-title":"Measure of parallelism in altenating computation trees","author":"King","year":"1981"},{"key":"10.1016\/S0019-9958(82)90572-1_bib14","series-title":"Proceedings, 19th IEEE Symp. on Foundations of Computer Science","article-title":"Alternating pushdown automata","author":"Ladner","year":"1978"},{"key":"10.1016\/S0019-9958(82)90572-1_bib15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00264255","article-title":"On alternation","volume":"14","author":"Paul","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(82)90572-1_bib16","first-page":"391","article-title":"On alternation","volume":"14","author":"Paul","year":"1980","journal-title":"II, Acta Inform."},{"key":"10.1016\/S0019-9958(82)90572-1_bib17","series-title":"Picture Languages: Formal Models for Picture Recognition","author":"Rosenfeld","year":"1979"},{"key":"10.1016\/S0019-9958(82)90572-1_bib18","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\/S0019-9958(82)90572-1_bib19","series-title":"Proceedings of the 21st Annual Symp. on Foundations of Computer Science","first-page":"62","article-title":"Efficient algorithms for paths system programs and applications to alternating and time-space complexity classes","author":"Sudborough","year":"1980"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882905721?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882905721?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T13:29:43Z","timestamp":1548941383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995882905721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["S0019995882905721"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(82)90572-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}