{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:40:46Z","timestamp":1648726846157},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"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":7960,"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":[[1991,10]]},"DOI":"10.1016\/0304-3975(91)90378-f","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"287-296","source":"Crossref","is-referenced-by-count":2,"title":["A note on real-time one-way alternating multicounter machines"],"prefix":"10.1016","volume":"88","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(91)90378-F_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01706072","article-title":"Multi-stack-counter languages","volume":"6","author":"Book","year":"1972","journal-title":"Math. Systems Theory"},{"issue":"1","key":"10.1016\/0304-3975(91)90378-F_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(91)90378-F_BIB3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"2","author":"Fisher","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(91)90378-F_BIB4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0019-9958(75)80002-7","article-title":"Erasable context-free languages","volume":"29","author":"Greibach","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90378-F_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(76)90072-4","article-title":"Remarks on the complexity of nondeterministic counter languages","volume":"1","author":"Greibach","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90378-F_BIB6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0022-0000(85)90063-7","article-title":"On the power of alternation in automata theory","volume":"31","author":"Hromkovic","year":"1985","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(91)90378-F_BIB7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(85)90100-0","article-title":"Alternating multicounter machines with constant number of reversals","volume":"21","author":"Hromkovic","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90378-F_BIB8","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/3-540-10843-2_40","article-title":"Alternating multihead finite automata","volume":"Vol. 115","author":"King","year":"1981","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(91)90378-F_BIB9","first-page":"92","article-title":"Alternating pushdown automata","author":"Ladner","year":"1978","journal-title":"Proc. 19th IEEE Symp. on Found. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90378-F_BIB10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(85)90048-9","article-title":"Alternating simple multihead finite automata","volume":"36","author":"Matsuno","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90378-F_BIB11","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(91)90378-F_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. Systems Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190378F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190378F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:31Z","timestamp":1555127731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190378F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["030439759190378F"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90378-f","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}