{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:27:37Z","timestamp":1648859257620},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"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":9421,"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":[[1987,10]]},"DOI":"10.1016\/0304-3975(87)90138-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"331-339","source":"Crossref","is-referenced-by-count":5,"title":["On reversal bounded alternating Turing machines"],"prefix":"10.1016","volume":"54","author":[{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Lory\u015b","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Piotr\u00f3w","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90138-1_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","article-title":"Reversal-bounded multipushdown machines","volume":"8","author":"Baker","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90138-1_BIB2","series-title":"Proc. 18th FOCS","first-page":"95","article-title":"Precise bound for Presburger arithmetic and the reals with addition","author":"Berman","year":"1977"},{"key":"10.1016\/0304-3975(87)90138-1_BIB3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1137\/0203023","article-title":"Reversal-bounded acceptors and intersections of linear languages","volume":"3","author":"Book","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(87)90138-1_BIB4","first-page":"147","article-title":"Reversal complexity of counter machines","author":"Chan","year":"1981","journal-title":"Proc. 13th ACM-STOC"},{"key":"10.1016\/0304-3975(87)90138-1_BIB5","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(87)90138-1_BIB6","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"},{"key":"10.1016\/0304-3975(87)90138-1_BIB7","series-title":"Proc. 9th ACM-STOC","first-page":"286","article-title":"Propositional modal logic of programs","author":"Fischer","year":"1977"},{"key":"10.1016\/0304-3975(87)90138-1_BIB8","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(68)80028-5","article-title":"The reduction of tape reversals for off-line one-tape Turing machines","volume":"2","author":"Fischer","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90138-1_BIB9","series-title":"IEEE Conf. Record of the 9th Ann. Symp. on Switching and Automata Theory","first-page":"373","article-title":"Tape reversal complexity hierarchies","author":"Fischer","year":"1968"},{"key":"10.1016\/0304-3975(87)90138-1_BIB10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","article-title":"Finite-turn pda","volume":"4","author":"Ginsburg","year":"1966","journal-title":"SIAM J. Contr. Optim."},{"key":"10.1016\/0304-3975(87)90138-1_BIB11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(68)80027-3","article-title":"Tape-reversal bounded Turing machine computations","volume":"2","author":"Hartmanis","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90138-1_BIB12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(87)90138-1_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0019-9958(70)90549-8","article-title":"Note on tape reversal complexity of languages","volume":"17","author":"Kameda","year":"1970","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(87)90138-1_BIB14","series-title":"Proc. 22nd FOCS","first-page":"235","article-title":"Towards separating nondeterministic time from deterministic time","author":"Kannan","year":"1981"},{"key":"10.1016\/0304-3975(87)90138-1_BIB15","series-title":"Report N-170","article-title":"Reversal efficient simulation of space bounded alternating Turing machines","author":"Li\u015bkiewicz","year":"1986"},{"key":"10.1016\/0304-3975(87)90138-1_BIB16","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(87)90138-1_BIB17","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0304-3975(85)90052-0","article-title":"A characterization of reversal-bounded multipushdown machine languages","volume":"36","author":"Rytter","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90138-1_BIB18","article-title":"Computational Complexity","volume":"19","author":"Wagner","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901381?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901381?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:52:55Z","timestamp":1555113175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587901381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["0304397587901381"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90138-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}