{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T22:30:02Z","timestamp":1726439402478},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,2]]},"abstract":"<jats:p> We investigate the efficiency of simulations of storages by several counters. A simulation of a pushdown store is described which is optimal in the sense that reducing the number of counters of a simulator leads to an increase in time complexity. The lower bound also establishes a tight counter hierarchy in exponential time. <\/jats:p><jats:p> Then we turn to simulations of a set of counters by a different number of counters. We improve and generalize a known simulation in polynomial time. Greibach has shown that adding s + 1 counters increases the power of machines working in time n<jats:sup>s<\/jats:sup>. Using a new family of languages we show here a tight hierarchy result for machines with the same polynomial time-bound. We also prove hierarchies for machines with a fixed number of counters and with growing polynomial time-bounds. <\/jats:p><jats:p> For machines with one counter and an additional \"store zero\" instruction we establish the equivalence of real-time and linear time. If at least two counters are available, the classes of languages accepted in real-time and linear time can be separated. <\/jats:p>","DOI":"10.1142\/s0129054111008106","type":"journal-article","created":{"date-parts":[[2011,2,21]],"date-time":"2011-02-21T05:13:46Z","timestamp":1298265226000},"page":"395-409","source":"Crossref","is-referenced-by-count":5,"title":["SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES"],"prefix":"10.1142","volume":"22","author":[{"given":"HOLGER","family":"PETERSEN","sequence":"first","affiliation":[{"name":"Reinsburgstra\u00dfe 75, D-70197, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01694011"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)80002-7"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90072-4"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90020-8"},{"volume-title":"Introduction to Automata Theory, Languages, and Computation","year":"2007","author":"Hopcroft J. E.","key":"rf5"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.09.015"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.2307\/1970290"},{"key":"rf9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita\/1980140100671","volume":"14","author":"Monien B.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"key":"rf10","doi-asserted-by":"crossref","unstructured":"P.\u00a0van Emde Boas, Hand-book of Theoretical Computer Science\u00a0A, ed. J.\u00a0van Leeuwen (Elsevier, Amsterdam, 1990)\u00a0pp. 1\u201366.","DOI":"10.1016\/B978-0-444-88071-0.50006-0"},{"key":"rf11","series-title":"Mathematics and its Applications","volume-title":"Computational Complexity","author":"Wagner K.","year":"1986"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111008106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:34:01Z","timestamp":1565123641000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111008106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":10,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,2]]}},"alternative-id":["10.1142\/S0129054111008106"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111008106","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}