{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:42:50Z","timestamp":1767912170443,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"4","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1982,10]]},"DOI":"10.1016\/0020-0190(82)90098-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"164-168","source":"Crossref","is-referenced-by-count":8,"title":["A note on alternating on-line Turing machines"],"prefix":"10.1016","volume":"15","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":"Hiroshi","family":"Taniguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(82)90098-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\/0020-0190(82)90098-9_BIB2","first-page":"92","article-title":"Alternating pushdown automata","author":"Ladner","year":"1978","journal-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(82)90098-9_BIB3","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. Syst. Sci."},{"key":"10.1016\/0020-0190(82)90098-9_BIB4","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\/0020-0190(82)90098-9_BIB5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00286494","article-title":"On alternation II","volume":"14","author":"Paul","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(82)90098-9_BIB6","first-page":"189","article-title":"Measures of parallelism in alternating computation trees","author":"King","year":"1981","journal-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(82)90098-9_BIB7","first-page":"37","article-title":"Two-dimensional alternating Turing machines","author":"Inoue","year":"1982","journal-title":"Proc. 14th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(82)90098-9_BIB8","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Hartmanis","year":"1965","journal-title":"IEEE Conf. Record of 6th Ann. Symp. on Switching Circuit Theory and Logical Design"},{"issue":"1","key":"10.1016\/0020-0190(82)90098-9_BIB9","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":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(82)90098-9_BIB10","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0020-0190(82)90098-9_BIB11","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(82)90098-9_BIB12","first-page":"62","article-title":"Efficient algorithms for path system problems and applications to alternating and time-space complexity classes","author":"Sudborough","year":"1980","journal-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900989?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900989?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:54:59Z","timestamp":1555088099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0020019082900989"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90098-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}