{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:08Z","timestamp":1720201088175},"reference-count":14,"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)90080-5","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"331-339","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Alternating on-line turing machines with only universal states and small space bounds"],"prefix":"10.1016","volume":"41","author":[{"given":"Katsushi","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itsuo","family":"Takanami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Vollmar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90080-5_BIB1","article-title":"Alternation","author":"Chandra","year":"1978"},{"issue":"1","key":"10.1016\/0304-3975(85)90080-5_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. ACM"},{"key":"10.1016\/0304-3975(85)90080-5_BIB3","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"1\u20133","key":"10.1016\/0304-3975(85)90080-5_BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0019-9958(82)90572-1","article-title":"Two-dimensional alternating Turing machines with only universal states","volume":"55","author":"Ito","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(85)90080-5_BIB5","series-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing","first-page":"37","article-title":"Two-dimensional alternating Turing machines","author":"Inoue","year":"1982"},{"issue":"4","key":"10.1016\/0304-3975(85)90080-5_BIB6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0020-0190(82)90098-9","article-title":"A note on alternating on-line Turing machines","volume":"15","author":"Inoue","year":"1982","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/0304-3975(85)90080-5_BIB7","first-page":"395","article-title":"A note on alternating on-line Turing machines with only universal states","volume":"E-66","author":"Inoue","year":"1983","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/0304-3975(85)90080-5_BIB8","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)90080-5_BIB9","series-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science","first-page":"92","article-title":"Alternating pushdown automata","author":"Ladner","year":"1978"},{"key":"10.1016\/0304-3975(85)90080-5_BIB10","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\/0304-3975(85)90080-5_BIB11","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)90080-5_BIB12","series-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science","first-page":"62","article-title":"Efficient algorithms for path system problems and applications to alternating and time-space complexity classes","author":"Sudborough","year":"1980"},{"key":"10.1016\/0304-3975(85)90080-5_BIB13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(83)90078-6","article-title":"Bandwidth constraints on problems complete for polynomial time","volume":"26","author":"Sudborough","year":"1983","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(85)90080-5_BIB14","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0020-0190(81)90013-2","article-title":"An extension of Savitch's theorem to small space bounds","volume":"12","author":"Tompa","year":"1981","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900805?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900805?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:53:14Z","timestamp":1553187194000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":14,"alternative-id":["0304397585900805"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90080-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}