{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:00:08Z","timestamp":1742994008480,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_13","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"151-163","source":"Crossref","is-referenced-by-count":0,"title":["Weighted Automata and Logics on Infinite Graphs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"D\u00fcck","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"16:1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 16:1\u201316:43 (2009)","journal-title":"J. ACM"},{"key":"13_CR2","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs in Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-642-02737-6_2","volume-title":"Developments in Language Theory","author":"B Bollig","year":"2009","unstructured":"Bollig, B., Gastin, P.: Weighted versus probabilistic logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 18\u201338. Springer, Heidelberg (2009)"},{"key":"13_CR4","unstructured":"Bollig, B., Kuske, D.: Muller message-passing automata and logics. In: LATA 2007, Report 35\/07, pp. 163\u2013174. Universitat Rovira i Virgili, Tarragona (2007)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/978-3-540-72734-7_5","volume-title":"Logical Foundations of Computer Science","author":"B Bollig","year":"2007","unstructured":"Bollig, B., Meinecke, I.: Weighted distributed systems and their logics. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 54\u201368. Springer, Heidelberg (2007)"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und Grundlagen Math. 6, 66\u201392 (1960)","journal-title":"Z. Math. Logik und Grundlagen Math."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-45022-X_18","volume-title":"Automata, Languages and Programming","author":"V Diekert","year":"2000","unstructured":"Diekert, V., Gastin, P.: LTL is expressively complete for Mazurkiewicz traces. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 211\u2013222. Springer, Heidelberg (2000)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-319-04921-2_26","volume-title":"Language and Automata Theory and Applications","author":"M Droste","year":"2014","unstructured":"Droste, M., D\u00fcck, S.: Weighted automata and logics for infinite nested words. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 323\u2013334. Springer, Heidelberg (2014)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-662-48057-1_15","volume-title":"Mathematical Foundations of Computer Science 2015","author":"M Droste","year":"2015","unstructured":"Droste, M., D\u00fcck, S.: Weighted automata and logics on graphs. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 192\u2013204. Springer, Heidelberg (2015)"},{"issue":"1\u20132","key":"13_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci. 380(1\u20132), 69\u201386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-642-24897-9_2","volume-title":"Algebraic Foundations in Computer Science","author":"M Droste","year":"2011","unstructured":"Droste, M., G\u00f6tze, D., M\u00e4rcker, S., Meinecke, I.: Weighted tree automata over valuation monoids and their characterization by weighted logics. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 30\u201355. Springer, Heidelberg (2011)"},{"key":"13_CR13","series-title":"EATCS Monographs in Theoretical Computer Science","volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2009)"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ic.2012.10.001","volume":"220","author":"M Droste","year":"2012","unstructured":"Droste, M., Meinecke, I.: Weighted automata and weighted MSO logics for average and long-time behaviors. Inf. Comput. 220, 44\u201359 (2012)","journal-title":"Inf. Comput."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 4036, pp. 49\u201358. Springer, Heidelberg (2006)"},{"issue":"3","key":"13_CR16","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 366(3), 228\u2013247 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR17","volume-title":"Automata, Languages, and Machines, Pure and Applied Mathematics","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, Pure and Applied Mathematics, vol. 59-A. Academic Press, New York (1974)"},{"issue":"1","key":"13_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc. 98(1), 21\u201352 (1961)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"13_CR19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/s00224-009-9225-3","volume":"48","author":"I Fichtner","year":"2011","unstructured":"Fichtner, I.: Weighted picture automata and weighted logics. Theory Comput. Syst. 48(1), 48\u201378 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"13_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00224-010-9296-1","volume":"50","author":"Z F\u00fcl\u00f6p","year":"2012","unstructured":"F\u00fcl\u00f6p, Z., St\u00fcber, T., Vogler, H.: A B\u00fcchi-like theorem for weighted tree automata over multioperator monoids. Theory Comput. Syst. 50(2), 241\u2013278 (2012)","journal-title":"Theory Comput. Syst."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Gastin, P., Monmege, B.: A unifying survey on weighted logics and weighted automata. Soft Comput. (2015). http:\/\/dx.doi.org\/10.1007\/s00500-015-1952-6","DOI":"10.1007\/s00500-015-1952-6"},{"issue":"1","key":"13_CR22","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/inco.1996.0018","volume":"125","author":"D Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Inf. Comput. 125(1), 32\u201345 (1996)","journal-title":"Inf. Comput."},{"key":"13_CR23","first-page":"132","volume-title":"The Theory of Models","author":"W Hanf","year":"1965","unstructured":"Hanf, W.: Model-theoretic methods in the study of elementary logic. In: Addison, J., Henkin, L., Tarski, A. (eds.) The Theory of Models, pp. 132\u2013145. North-Holland, Amsterdam (1965)"},{"issue":"4","key":"13_CR24","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF02679464","volume":"30","author":"HJ Hoogeboom","year":"1997","unstructured":"Hoogeboom, H.J., ten Pas, P.: Monadic second-order definable text languages. Theory Comput. Syst. 30(4), 335\u2013354 (1997)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"13_CR25","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/j.tcs.2009.09.040","volume":"411","author":"C Mathissen","year":"2010","unstructured":"Mathissen, C.: Definable transductions and weighted logics for texts. Theory Comput. Sci. 411(3), 631\u2013659 (2010)","journal-title":"Theory Comput. Sci."},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-540-70583-3_19","volume-title":"Automata, Languages and Programming","author":"C Mathissen","year":"2008","unstructured":"Mathissen, C.: Weighted logics for nested words and algebraic formal power series. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 221\u2013232. Springer, Heidelberg (2008)"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3967, pp. 235\u2013246. Springer, Heidelberg (2006)"},{"key":"13_CR28","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u201335 (1969)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"13_CR29","first-page":"455","volume":"12","author":"G Rahonis","year":"2007","unstructured":"Rahonis, G.: Weighted muller tree automata and weighted logics. Int. J. Autom. Lang. Comb. 12(4), 455\u2013483 (2007)","journal-title":"Int. J. Autom. Lang. Comb."},{"issue":"2\u20133","key":"13_CR30","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Inf. Control 4(2\u20133), 245\u2013270 (1961)","journal-title":"Inf. Control"},{"issue":"1","key":"13_CR31","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"JW Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2(1), 57\u201381 (1968)","journal-title":"Math. Syst. Theory"},{"key":"13_CR32","unstructured":"Thomas, W.: On logical definability of trace languages. In: Diekert, V. (ed.) Proceedings of Workshop on ASMICS 1989, pp. 172\u2013182. Technical University of Munich (1990)"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-54233-7_154","volume-title":"International Colloquium on Automata, Languages, and Programming, ICALP 1991","author":"W Thomas","year":"1991","unstructured":"Thomas, W.: On logics, tilings, and automata. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) ICALP 1991. LNCS, vol. 510, pp. 441\u2013454. Springer, Heidelberg (1991)"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Elements of an automata theory over partial orders. In: Proceedings of DIMACS Workshop, POMIV 1996, pp. 25\u201340. AMS Press Inc., New York (1996)","DOI":"10.1090\/dimacs\/029\/02"},{"key":"13_CR35","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. 3, pp. 389\u2013455. Springer, New York (1997)"},{"key":"13_CR36","first-page":"326","volume":"140","author":"BA Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSR 140, 326\u2013329 (1961). (in Russian)","journal-title":"Doklady Akademii Nauk SSR"}],"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-662-53132-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:27:50Z","timestamp":1568186870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}