{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T04:14:36Z","timestamp":1744085676769,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_33","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"361-368","source":"Crossref","is-referenced-by-count":0,"title":["Automata with Modulo Counters and Nondeterministic Counter Bounds"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Reidenbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus L.","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(86)90112-X","volume":"44","author":"J.H. Chang","year":"1986","unstructured":"Chang, J.H., Ibarra, O.H., Palis, M.A., Ravikumar, B.: On pebble automata. Theoretical Computer Science\u00a044, 111\u2013121 (1986)","journal-title":"Theoretical Computer Science"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-02737-6_19","volume-title":"Developments in Language Theory","author":"P. Frisco","year":"2009","unstructured":"Frisco, P., Ibarra, O.H.: On Stateless Multihead Finite Automata and Multihead Pushdown Automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 240\u2013251. Springer, Heidelberg (2009)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2010.08.024","volume":"412","author":"M. Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science\u00a0412, 83\u201396 (2011)","journal-title":"Theoretical Computer Science"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM\u00a025, 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-02882-3_41","volume-title":"Computing and Combinatorics","author":"O.H. Ibarra","year":"2009","unstructured":"Ibarra, O.H., E\u011fecio\u011flu, \u00d6.: Hierarchies and Characterizations of Stateless Multicounter Machines. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 408\u2013417. Springer, Heidelberg (2009)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.tcs.2009.09.001","volume":"411","author":"O.H. Ibarra","year":"2010","unstructured":"Ibarra, O.H., Karhum\u00e4ki, J., Okhotin, A.: On stateless multihead automata: Hierarchies and the emptiness problem. Theoretical Computer Science\u00a0411, 581\u2013593 (2010)","journal-title":"Theoretical Computer Science"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.tcs.2006.01.030","volume":"356","author":"O.H. Ibarra","year":"2006","unstructured":"Ibarra, O.H., Ravikumar, B.: On partially blind multihead finite automata. Theoretical Computer Science\u00a0356, 190\u2013199 (2006)","journal-title":"Theoretical Computer Science"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1142\/S0129054110007556","volume":"21","author":"M. Kutrib","year":"2010","unstructured":"Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. International Journal of Foundations of Computer Science\u00a021, 781\u2013798 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"33_CR9","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. RAIRO Informatique Th\u00e9orique\u00a014, 67\u201382 (1980)","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Petersen, H.: Automata with sensing heads. In: Proc. 3rd Israel Symposium on Theory of Computing and Systems, pp. 150\u2013157 (1995)","DOI":"10.1109\/ISTCS.1995.377036"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-18098-9_26","volume-title":"Implementation and Application of Automata","author":"D. Reidenbach","year":"2011","unstructured":"Reidenbach, D., Schmid, M.L.: A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 241\u2013250. Springer, Heidelberg (2011)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1142\/S0129054108006261","volume":"19","author":"L. Yang","year":"2008","unstructured":"Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and p systems. International Journal of Foundations of Computer Science\u00a019, 1259\u20131276 (2008)","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T07:47:31Z","timestamp":1744012051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}