{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:59:58Z","timestamp":1725533998917},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_33","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T08:40:30Z","timestamp":1246351230000},"page":"410-418","source":"Crossref","is-referenced-by-count":0,"title":["Simulations by Time-Bounded Counter Machines"],"prefix":"10.1007","author":[{"given":"Holger","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01694011","volume":"2","author":"P.C. Fischer","year":"1968","unstructured":"Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Counter machines and counter languages. Mathematical Systems Theory\u00a02, 265\u2013283 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0304-3975(76)90072-4","volume":"1","author":"S.A. Greibach","year":"1976","unstructured":"Greibach, S.A.: Remarks on the complexity of nondeterministic counter languages. Theoretical Computer Science\u00a01, 269\u2013288 (1976)","journal-title":"Theoretical Computer Science"},{"key":"33_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2007","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson, London (2007)","edition":"3"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.09.015","volume":"330","author":"J. Hromkovi\u010d","year":"2005","unstructured":"Hromkovi\u010d, J., Schnitger, G.: On the power of randomized multicounter machines. Theoretical Computer Science\u00a0330, 135\u2013144 (2005)","journal-title":"Theoretical Computer Science"},{"key":"33_CR5","unstructured":"Laing, R.: Realization and complexity of commutative events. Technical Report 03105-48-T, University of Michigan (1967)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M.L. Minsky","year":"1961","unstructured":"Minsky, M.L.: Recursive unsolvability of Post\u2019s problem of \u201ctag\u201d and other topics in theory of Turing machines. Annals of Mathematics\u00a074, 437\u2013455 (1961)","journal-title":"Annals of Mathematics"},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita\/1980140100671","volume":"14","author":"B. Monien","year":"1980","unstructured":"Monien, B.: Two-way multihead automata over a one-letter alphabet. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications\u00a014, 67\u201382 (1980)","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"key":"33_CR8","first-page":"1","volume-title":"Handbook of Theoretical Computer Science","author":"P. Emde Boas van","year":"1990","unstructured":"van Emde Boas, P.: Machine models and simulations. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 1\u201366. Elsevier, Amsterdam (1990)"},{"key":"33_CR9","series-title":"Mathematics and its Applications","volume-title":"Computational Complexity","author":"K. Wagner","year":"1986","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. Mathematics and its Applications. D.\u00a0Reidel Publishing Company, Dordrecht (1986)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02737-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T21:07:09Z","timestamp":1552079229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}