{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:26:51Z","timestamp":1766136411994},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_25","type":"book-chapter","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T21:07:42Z","timestamp":1373490462000},"page":"280-291","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic Counter Machines and Parallel Matching Computations"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Calude, C.S., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.): Multiset Processing. LNCS, vol.\u00a02235. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45523-X"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-88282-4_19","volume-title":"Language and Automata Theory and Applications","author":"S. Crespi Reghizzi","year":"2008","unstructured":"Crespi Reghizzi, S., San Pietro, P.: Consensual definition of languages by regular sets. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 196\u2013208. Springer, Heidelberg (2008)"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1051\/ita\/2011012","volume":"45","author":"S. Crespi Reghizzi","year":"2011","unstructured":"Crespi Reghizzi, S., San Pietro, P.: Consensual languages and matching finite-state computations. RAIRO - Theor. Inf. and Applic.\u00a045(1), 77\u201397 (2011)","journal-title":"RAIRO - Theor. Inf. and Applic."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-31606-7_10","volume-title":"Implementation and Application of Automata","author":"S. Crespi Reghizzi","year":"2012","unstructured":"Crespi Reghizzi, S., San Pietro, P.: Strict local testability with consensus equals regularity. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 113\u2013124. Springer, Heidelberg (2012)"},{"issue":"3","key":"25_CR5","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(3), 265\u2013283 (1968)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"25_CR6","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(4), 269\u2013288 (1976)","journal-title":"Theoretical Computer Science"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S.A. Greibach","year":"1978","unstructured":"Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci.\u00a07, 311\u2013324 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR8","volume-title":"Formal languages and their relation to automata","author":"J. Hopcroft","year":"1969","unstructured":"Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Addison-Wesley, Wokingham (1969)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1984","author":"J. Hromkovic","year":"1984","unstructured":"Hromkovic, J.: Hierarchy of reversal and zerotesting bounded multicounter machines. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol.\u00a0176, Springer, Heidelberg (1984)"},{"key":"25_CR10","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge (1971)"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of \u2018tag\u2019 and other topics in the theory of Turing machines. Annals of Mathematics\u00a074(3), 437\u2013455 (1961)","journal-title":"Annals of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:34:44Z","timestamp":1557930884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}