{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:16:38Z","timestamp":1762323398861},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_14","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"166-177","source":"Crossref","is-referenced-by-count":2,"title":["One-Reversal Counter Machines and Multihead Automata: Revisited"],"prefix":"10.1007","author":[{"given":"Ehsan","family":"Chiniforooshan","sequence":"first","affiliation":[]},{"given":"Mark","family":"Daley","sequence":"additional","affiliation":[]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[]},{"given":"Lila","family":"Kari","sequence":"additional","affiliation":[]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B.S. Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences\u00a08, 315\u2013332 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","volume":"306","author":"M. Daley","year":"2003","unstructured":"Daley, M., Ibarra, O., Kari, L.: Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theoretical Computer Science\u00a0306, 19\u201338 (2003)","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(82)80023-5","volume":"54","author":"P. Duris","year":"1982","unstructured":"Duris, P., Galil, Z.: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Information and Control\u00a054, 217\u2013227 (1982)","journal-title":"Information and Control"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-03073-4_19","volume-title":"Mathematical Theory and Computational Practice","author":"\u00d6. E\u011fecio\u011flu","year":"2009","unstructured":"E\u011fecio\u011flu, \u00d6., Ibarra, O.H.: On stateless multicounter machines. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol.\u00a05635, pp. 178\u2013187. Springer, Heidelberg (2009)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1006\/jcss.2002.1836","volume":"65","author":"T. Harju","year":"2002","unstructured":"Harju, T., Ibarra, O.H., Karhum\u00e4ki, J., Salomaa, A.: Some decision problems concerning semilinearity and commutation. Journal of Computer and System Sciences\u00a065, 278\u2013294 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"14_CR7","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":"14_CR8","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":"14_CR9","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":"14_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11047-007-9043-y","volume":"7","author":"O.H. Ibarra","year":"2008","unstructured":"Ibarra, O.H., Woodworth, S., Yu, F., P\u0103un, A.: On spiking neural P systems and partially blind counter machines. Natural Computing\u00a07, 3\u201319 (2008)","journal-title":"Natural Computing"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(86)90099-2","volume":"22","author":"M. Li","year":"1986","unstructured":"Li, M., Yesha, Y.: String-matching cannot be done by a two-head one-way deterministic finite automaton. Information Processing Letters\u00a022, 231\u2013235 (1986)","journal-title":"Information Processing Letters"},{"key":"14_CR12","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":"14_CR13","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1147\/rd.105.0388","volume":"10","author":"A.L. Rosenberg","year":"1966","unstructured":"Rosenberg, A.L.: On multi-head finite automata. IBM Journal of Research and Development\u00a010, 388\u2013394 (1966)","journal-title":"IBM Journal of Research and Development"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0304-3975(02)00027-0","volume":"281","author":"G. S\u00e9nizergues","year":"2002","unstructured":"S\u00e9nizergues, G.: l(a)\u2009=\u2009l(b)? a simplified decidability proof. Theoretical Computer Science\u00a0281, 555\u2013608 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/322063.322076","volume":"25","author":"A.C. Yao","year":"1978","unstructured":"Yao, A.C., Rivest, R.L.: k\u2009+\u20091 heads are better than k. Journal of the ACM\u00a025(2), 337\u2013340 (1978)","journal-title":"Journal of the ACM"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(89)90108-7","volume":"31","author":"S. Yu","year":"1989","unstructured":"Yu, S.: A pumping lemma for deterministic context-free languages. Information Processing Letters\u00a031, 47\u201351 (1989)","journal-title":"Information Processing Letters"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T11:03:10Z","timestamp":1553338990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}