{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:38:36Z","timestamp":1648849116941},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1007\/bf01185400","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T16:49:28Z","timestamp":1108745368000},"page":"329-339","source":"Crossref","is-referenced-by-count":0,"title":["On the power of 1-tape off-line ATMs running in a bounded number of reversals"],"prefix":"10.1007","volume":"28","author":[{"given":"M.","family":"Li\u015bkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01185400_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. S. Baker","year":"1974","unstructured":"B. S. Baker and R. V. Book, Reversal bounded multipushdown machines,J. Comput. System Sci.,8 (1974), 315\u2013322.","journal-title":"J. Comput. System Sci."},{"key":"BF01185400_CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. Kozen, and L. J. Stockmeyer, Alternation,J. Assoc. Comput. Mach.,28 (1981), 114\u2013133.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01185400_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979."},{"key":"BF01185400_CR4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1137\/0220018","volume":"20","author":"O. H. Ibarra","year":"1991","unstructured":"O. H. Ibarra and T. Jiang, The power of alternating one-reversal counters and stacks.SIAM J. Comput.,20 (1991), 278\u2013290.","journal-title":"SIAM J. Comput."},{"key":"BF01185400_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(90)90024-C","volume":"76","author":"T. Jiang","year":"1990","unstructured":"T. Jiang, On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals,Theoret, Comput. Sci.,76 (1990), 323\u2013330.","journal-title":"Theoret, Comput. Sci."},{"key":"BF01185400_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0219014","volume":"19","author":"M. Kutytowski","year":"1990","unstructured":"M. Kutytowski, M. Liskiewicz, and K. Lory\u015b, Reversal complexity classes for alternating Turing machines,SIAM J. Comput.,19 (1990), 207\u2013221.","journal-title":"SIAM J. Comput."},{"key":"BF01185400_CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"R. E. Ladner","year":"1984","unstructured":"R. E. Ladner, R. J. Lipton, and L. J. Stockmeyer, Alternating pushdown and stack automata,SIAM J. Comput,13 (1984), 135\u2013155.","journal-title":"SIAM J. Comput"},{"key":"BF01185400_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(87)90138-1","volume":"54","author":"M. Li\u015bkiewicz","year":"1987","unstructured":"M. Li\u015bkiewicz, K. Lorys, and M. Piotr\u00f3w, On reversal-bounded alternating Turing machines,Theoret. Comput. Sci.,54 (1987), 331\u2013339.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01185400_CR9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0890-5401(87)90055-1","volume":"75","author":"H. Yamamoto","year":"1987","unstructured":"H. Yamamoto and S. Noguchi, Comparison of the power between reversal-bounded ATMs and reversal-bounded NTMs,Inform, and Comput.,75 (1987), 144\u2013161.","journal-title":"Inform, and Comput."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185400\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:41:37Z","timestamp":1556728897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01185400"],"URL":"https:\/\/doi.org\/10.1007\/bf01185400","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}