{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:52:15Z","timestamp":1648709535725},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"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":[[2001,5]]},"DOI":"10.1016\/s0304-3975(00)00035-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"475-492","source":"Crossref","is-referenced-by-count":2,"title":["Alternation for sublogarithmic space-bounded alternating pushdown automata"],"prefix":"10.1016","volume":"259","author":[{"given":"Jianliang","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsunehiro","family":"Yoshinaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsushi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00035-9_BIB1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01271368","article-title":"The alternation hierarchy for sublogarithmic space is infinite","volume":"3","author":"Braunm\u00fchl","year":"1993","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(00)00035-9_BIB2","doi-asserted-by":"crossref","unstructured":"G. Buntrock, A. Hoene, Reversals and alternations, Proc. STACS\u201989, 1989, pp. 218\u2013228.","DOI":"10.1007\/BFb0028986"},{"issue":"1","key":"10.1016\/S0304-3975(00)00035-9_BIB3","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\/S0304-3975(00)00035-9_BIB4","doi-asserted-by":"crossref","unstructured":"J.H. Chang, O.H. Ibarra, B. Ravikumar, Some observations concerning alternating Turing machines using small space, Inform. Process. Lett. 25 (1987) 1\u20139. (Erratum: Inform. Process. Lett. 27 (1988) 53.)","DOI":"10.1016\/0020-0190(88)90081-6"},{"key":"10.1016\/S0304-3975(00)00035-9_BIB5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(82)80023-5","article-title":"On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store","volume":"54","author":"Duris","year":"1982","journal-title":"Inform. and Control"},{"issue":"5","key":"10.1016\/S0304-3975(00)00035-9_BIB6","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1051\/ita\/1994280504651","article-title":"A hierarchy that does not collapse: alternations in low level space","volume":"28","author":"Geffert","year":"1994","journal-title":"Informatique th\u00e9orique et Applications\/Theoret. Inform. and Appl."},{"key":"10.1016\/S0304-3975(00)00035-9_BIB7","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(00)00035-9_BIB8","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\/S0304-3975(00)00035-9_BIB9","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\/S0304-3975(00)00035-9_BIB10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(94)90105-8","article-title":"On 1-inkdot alternating Turing machines with small space","volume":"127","author":"Inoue","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"10.1016\/S0304-3975(00)00035-9_BIB11","first-page":"990","article-title":"A note on alternating Turing machines using small space","volume":"E70","author":"Ito","year":"1987","journal-title":"IEICE Trans."},{"key":"10.1016\/S0304-3975(00)00035-9_BIB12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(88)90122-3","article-title":"Alternating multihead finite automata","volume":"61","author":"King","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(00)00035-9_BIB13","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1137\/S0097539793252444","article-title":"The sublogarithmic alternating space world","volume":"25","author":"Li\u015bkiewicz","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00035-9_BIB14","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\/S0304-3975(00)00035-9_BIB15","volume":"Vol. 843","author":"Szepietowski","year":"1994"},{"issue":"4","key":"10.1016\/S0304-3975(00)00035-9_BIB16","first-page":"259","article-title":"A note on alternating pushdown automata with sublogarithmic space","volume":"E79-D","author":"Xu","year":"1996","journal-title":"IEICE Trans."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000359?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000359?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:19Z","timestamp":1578458899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0304397500000359"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00035-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}