{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:53:33Z","timestamp":1743080013273,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220111"},{"type":"electronic","value":"9783642220128"}],"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-22012-8_18","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T03:29:39Z","timestamp":1308367779000},"page":"234-245","source":"Crossref","is-referenced-by-count":2,"title":["The Cost of Traveling between Languages"],"prefix":"10.1007","author":[{"given":"Michael","family":"Benedikt","sequence":"first","affiliation":[]},{"given":"Gabriele","family":"Puppis","sequence":"additional","affiliation":[]},{"given":"Cristian","family":"Riveros","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Puppis, G., Riveros, C.: Regular repair of specifications. In: LICS (2011)","DOI":"10.1109\/LICS.2011.43"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. J. of Game Theory\u00a08, 109\u2013113 (1979)","journal-title":"J. of Game Theory"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: STOC, pp. 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"issue":"9","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.ic.2007.06.001","volume":"205","author":"S. Konstantinidis","year":"2007","unstructured":"Konstantinidis, S.: Computing the edit distance of a regular language. Inf. and Comp.\u00a0205(9), 1307\u20131316 (2007)","journal-title":"Inf. and Comp."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-55719-9_67","volume-title":"Automata, Languages and Programming","author":"D. Krob","year":"1992","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 101\u2013112. Springer, Heidelberg (1992)"},{"key":"18_CR6","unstructured":"Matouek, J., G\u00e4rtner, B.: Understanding and Using Linear Programming (2006)"},{"issue":"2","key":"18_CR7","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. J. of Comp. Ling.\u00a023(2), 269\u2013311 (1997)","journal-title":"J. of Comp. Ling."},{"issue":"6","key":"18_CR8","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054103002114","volume":"14","author":"M. Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata: general definitions and algorithms. J. of Found. of Comp. Sc.\u00a014(6), 957\u2013982 (2003)","journal-title":"J. of Found. of Comp. Sc."},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0017135","volume-title":"Mathematical Foundations of Computer Science 1988","author":"I. Simon","year":"1988","unstructured":"Simon, I.: Recognizable sets with multiplicities in the tropical semiring. In: Koubek, V., Janiga, L., Chytil, M.P. (eds.) MFCS 1988. LNCS, vol.\u00a0324, pp. 107\u2013120. Springer, Heidelberg (1988)"},{"issue":"5","key":"18_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/360980.360995","volume":"17","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A.: Order-n correction for regular languages. CACM\u00a017(5), 265\u2013268 (1974)","journal-title":"CACM"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. JACM\u00a021(1), 168\u2013173 (1974)","journal-title":"JACM"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci.\u00a0158, 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22012-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T21:53:23Z","timestamp":1553810003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}