{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T21:24:30Z","timestamp":1790717070362,"version":"4.1.0"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319986531","type":"print"},{"value":"9783319986548","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_7","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"83-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weak Cost Register Automata Are Still Powerful"],"prefix":"10.1007","author":[{"given":"Shaull","family":"Almagor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u00ebl","family":"Cadilhac","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filip","family":"Mazowiecki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-24372-1_37","volume-title":"Automated Technology for Verification and Analysis","author":"S Almagor","year":"2011","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s decidable about weighted automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 482\u2013491. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-24372-1_37"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: LICS 2013, pp. 13\u201322 (2013). \n                    https:\/\/doi.org\/10.1109\/LICS.2013.65","DOI":"10.1109\/LICS.2013.65"},{"issue":"7","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1142\/S0129054113400339","volume":"24","author":"M Cadilhac","year":"2013","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: Unambiguous constrained automata. Int. J. Found. Comput. Sci. 24(7), 1099\u20131116 (2013). \n                    https:\/\/doi.org\/10.1142\/S0129054113400339","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"7_CR4","first-page":"153","volume":"40","author":"S Gaubert","year":"2004","unstructured":"Gaubert, S., Katz, R.: Rational semimodules over the max-plus semiring and geometric approach to discrete event systems. Kybernetika 40(2), 153\u2013180 (2004)","journal-title":"Kybernetika"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-00008290051-4","volume":"24","author":"K Hashiguchi","year":"1982","unstructured":"Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci. 24(2), 233\u2013244 (1982). \n                    https:\/\/doi.org\/10.1016\/0022-00008290051-4","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Mazowiecki, F., Riveros, C.: Copyless cost-register automata: structure, expressiveness, andclosure properties. In: STACS 2016, pp. 53:1\u201353:13 (2016). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.53","DOI":"10.4230\/LIPIcs.STACS.2016.53"},{"key":"7_CR7","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes Rendus du Premier Congr\u00e8s des Math\u00e9maticiens des Pays Slaves, Warsaw, pp. 92\u2013101 (1927)"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-39759190381-B","volume":"88","author":"A Weber","year":"1991","unstructured":"Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theor. Comput. Sci. 88(2), 325\u2013349 (1991). \n                    https:\/\/doi.org\/10.1016\/0304-39759190381-B","journal-title":"Theor. Comput. Sci."}],"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-319-98654-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:08:47Z","timestamp":1535915327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}