{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T06:00:07Z","timestamp":1720936807666},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":7017,"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":[[1994,5]]},"DOI":"10.1016\/0304-3975(94)90105-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"171-179","source":"Crossref","is-referenced-by-count":7,"title":["On 1-inkdot alternating Turing machines with small space"],"prefix":"10.1016","volume":"127","author":[{"given":"Katsushi","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Ito","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(94)90105-8_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(94)90105-8_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(87)90085-8","article-title":"Some observations concerning alternating Turing machines using small space","volume":"25","author":"Chang","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90105-8_BIB3","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0220031","article-title":"Nondeterministic computations in sublogarithmic space and space constructibility","volume":"20","author":"Geffert","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90105-8_BIB4","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(94)90105-8_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(92)90205-A","article-title":"A relationship between nondeterministic Turing machines and 1-inkdot turing machines with small space","volume":"43","author":"Inoue","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90105-8_BIB6","article-title":"A note on 1-inkdot alternating Turing machines with small space","author":"Inoue","year":"1992","journal-title":"COMP92-35"},{"key":"10.1016\/0304-3975(94)90105-8_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(85)90080-5","article-title":"Alternating on-line Turing machines with only universal states and small space bounds","volume":"41","author":"Inoue","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90105-8_BIB8","first-page":"189","article-title":"Measure of parallelism in alternating computation trees","author":"King","year":"1981","journal-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90105-8_BIB9","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\/0304-3975(94)90105-8_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(94)90105-8_BIB11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(91)90391-E","article-title":"Space bounded computations: review and new separation results","volume":"80","author":"Ranjan","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90105-8_BIB12","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:04Z","timestamp":1555129624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0304397594901058"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90105-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}