{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:11Z","timestamp":1725493451913},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_9","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T01:44:48Z","timestamp":1193449488000},"page":"73-84","source":"Crossref","is-referenced-by-count":4,"title":["Weighted Automata and Weighted Logics with Discounting"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Rahonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"International Series in Computer Science","volume-title":"Finite Transition Systems","author":"A. Arnold","year":"1994","unstructured":"Arnold, A.: Finite Transition Systems. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1994)"},{"key":"9_CR2","volume-title":"EATCS Monographs in Theoretical Computer Science","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. In: EATCS Monographs in Theoretical Computer Science, vol.\u00a012, Springer, Heidelberg (1988)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlager Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlager Math."},{"key":"9_CR4","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science, pp. 1\u201311 (1962)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0097-8493(93)90079-O","volume":"17","author":"K. Culik II","year":"1993","unstructured":"Culik II, K., Kari, J.: Image compression using weighted finite automata. Computer and Graphics\u00a017, 305\u2013313 (1993)","journal-title":"Computer and Graphics"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1137\/S0097539791224893","volume":"23","author":"K. Culik","year":"1994","unstructured":"Culik, K., Karhum\u00e4ki, J.: Finite automata computing real functions. SIAM J. Comput.\u00a023(4), 789\u2013814 (1994)","journal-title":"SIAM J. Comput."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1076-5670(08)70083-1","volume":"90","author":"R.A. Cuninghame-Green","year":"1995","unstructured":"Cuninghame-Green, R.A.: Minimax algebra and applications. Adv. in Imaging Electron Phy.\u00a090, 1\u2013121 (1995)","journal-title":"Adv. in Imaging Electron Phy."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L., Henzinger, T.A., Majumda, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1022\u20131037. Springer, Heidelberg (2003)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoret. Comput. Sci. 380, 69\u201386 (2007) extended abstract In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 513\u2013525. Springer, Heidelberg (2005)","DOI":"10.1016\/j.tcs.2007.02.055"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-45061-0_35","volume-title":"Automata, Languages and Programming","author":"M. Droste","year":"2003","unstructured":"Droste, M., Kuske, D.: Skew and infinitary formal power series. Theoret. Comput. Sci. 366, 189\u2013227 (2006). extended abstract In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 426\u2013438. Springer, Heidelberg (2003)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11779148_6","volume-title":"Developments in Language Theory","author":"M. Droste","year":"2006","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 49\u201358. Springer, Heidelberg (2006)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.tcs.2006.08.025","volume":"366","author":"M. Droste","year":"2006","unstructured":"Droste, M., Vogler, H.: Weighted tree automata and weighted logics. Theoret. Comput. Sci.\u00a0366, 228\u2013247 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR13","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2307\/1993511","volume":"98","author":"C. Elgot","year":"1961","unstructured":"Elgot, C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201352 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"9_CR15","first-page":"203","volume":"10","author":"Z. \u00c9sik","year":"2005","unstructured":"\u00c9sik, Z., Kuich, W.: A semiring-semimodule generalization of \u03c9 -regular languages\u00a0I and II. Special issue on \u201cWeighted automata\u201d. In: Droste, M., Vogler, H. (eds.) J. of Automata Languages and Combinatorics\u00a010, 203\u2013242, 243\u2013264 (2005)","journal-title":"J. of Automata Languages and Combinatorics"},{"key":"9_CR16","volume-title":"Competitive Marcov Decision Processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Marcov Decision Processes. Springer, Heidelberg (1997)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Gaubert, S., Plus, M.: Methods and applications of (max, +) linear algebra, Techical Report 3088, INRIA, Rocquencourt (January 1997)","DOI":"10.1007\/BFb0023465"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/3-540-44968-X_44","volume-title":"Computing and Combinatorics","author":"Z. Jiang","year":"2000","unstructured":"Jiang, Z., Litow, B., de Vel, O.: Similarity enrichment in image compression through weighted finite automata. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 447\u2013456. Springer, Heidelberg (2000)"},{"key":"9_CR19","unstructured":"Katritzke, F.: Refinements of data compression using weighted finite automata, PhD thesis, Universit\u00e4t Siegen, Germany (2001)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nerode, A.: Automata Theory and its Applications, Birkh\u00e4user Boston (2001)","DOI":"10.1007\/978-1-4612-0171-7"},{"issue":"4","key":"9_CR21","first-page":"599","volume":"24","author":"K. Knight","year":"1998","unstructured":"Knight, K., Graehl, J.: Machine transliteration. Comput. Linguist.\u00a024(4), 599\u2013612 (1998)","journal-title":"Comput. Linguist."},{"key":"9_CR22","first-page":"405","volume":"4","author":"D. Krob","year":"1994","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Intern. J. of Information and Computation\u00a04, 405\u2013425 (1994)","journal-title":"Intern. J. of Information and Computation"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages","author":"W. Kuich","year":"1997","unstructured":"Kuich, W.: Semirings and formal power series: Their relevance to formal languages and automata theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 609\u2013677. Springer, Heidelberg (1997)"},{"key":"9_CR24","unstructured":"Kuich, W.: On skew formal power series. In: Bozapalidis, S., Kalampakas, A., Rahonis, G. (eds.) Proceedings of the Conference on Algebraic Informatics, Thessaloniki, pp. 7\u201330 (2005)"},{"key":"9_CR25","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs in Theoretical Computer Science, vol.\u00a05. Springer, Heidelberg (1986)"},{"key":"9_CR26","series-title":"Princeton Series in Computer Science","volume-title":"Computer-Aided Verification of Coordinating Processes","author":"R.P. Kurshan","year":"1994","unstructured":"Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes. Princeton Series in Computer Science. Princeton University Press, Princeton (1994)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Mathissen, C.: Definable transductions and weighted logics for texts. In: Proceedings of DLT 2007. 11th International Conference on Developments in Language Theory (DLT) 2007. LNCS, vol.\u00a04588, pp. 324\u2013336 (2007)","DOI":"10.1007\/978-3-540-73208-2_31"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11672142_25","volume-title":"STACS 2006","author":"I. M\u00e4urer","year":"2006","unstructured":"M\u00e4urer, I.: Weighted picture automata and weighted logics. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 313\u2013324. Springer, Heidelberg (2006)"},{"key":"9_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K. McMillan","year":"1993","unstructured":"McMillan, K.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11753728_25","volume-title":"Computer Science \u2013 Theory and Applications","author":"I. Meinecke","year":"2006","unstructured":"Meinecke, I.: Weighted logics for traces. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 235\u2013246. Springer, Heidelberg (2006)"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(99)00014-6","volume":"231","author":"M. Mohri","year":"2000","unstructured":"Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoret. Comput. Sci.\u00a0231, 17\u201332 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR32","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words. Elsevier, Amsterdam (2004)"},{"key":"9_CR33","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Heidelberg (1978)"},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.: On the definition of a family of automata. Inf. Control\u00a04, 245\u2013270 (1961)","journal-title":"Inf. Control"},{"key":"9_CR35","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: Stochastic games. Roc. National Acad. of Sciences\u00a039, 1095\u20131100 (1953)","journal-title":"Roc. National Acad. of Sciences"},{"key":"9_CR36","first-page":"135","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Leeuwen, J.v. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 135\u2013191. Elsevier Science Publishers, Amsterdam (1990)"},{"key":"9_CR37","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013485. Springer, Heidelberg (1997)"},{"key":"9_CR38","volume-title":"Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics","author":"U. Zimmermann","year":"1981","unstructured":"Zimmermann, U.: Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics, vol.\u00a010. North-Holland, Amsterdam (1981)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:48:17Z","timestamp":1619506097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_9","relation":{},"subject":[]}}