{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:05:04Z","timestamp":1767236704200},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_19","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"221-232","source":"Crossref","is-referenced-by-count":17,"title":["Weighted Logics for Nested Words and Algebraic Formal Power Series"],"prefix":"10.1007","author":[{"given":"Christian","family":"Mathissen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1102\u20131114. Springer, Heidelberg (2005)"},{"key":"19_CR2","first-page":"202","volume-title":"Proc. of the 36th STOC","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of the 36th STOC, Chicago, pp. 202\u2013211. ACM, New York (2004)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1007\/978-3-540-73420-8_76","volume-title":"Automata, Languages and Programming","author":"M. Arenas","year":"2007","unstructured":"Arenas, M., Barcel\u00f3, P., Libkin, L.: Regular languages of nested words: Fixed points, automata, and synchronization. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 888\u2013900. Springer, Heidelberg (2007)"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland, Amsterdam (1963)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","volume":"126","author":"B. Courcelle","year":"1994","unstructured":"Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoretical Computer Science\u00a0126, 53\u201375 (1994)","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0380, 69\u201386 (2007)","journal-title":"Theoretical Computer Science"},{"key":"19_CR8","volume-title":"Handbook of Weighted Automata, ch.5","author":"M. Droste","year":"2008","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch.5. Springer, Heidelberg (to appear, 2008)"},{"key":"19_CR9","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: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 49\u201358. Springer, Heidelberg (2006)"},{"key":"19_CR10","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. Theoretical Computer Science\u00a0366, 228\u2013247 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR11","first-page":"3","volume":"9","author":"Z. \u00c9sik","year":"2004","unstructured":"\u00c9sik, Z., N\u00e9meth, Z.L.: Higher dimensional automata. Journal of Automata, Languages and Combinatorics\u00a09(1), 3\u201329 (2004)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"3","key":"19_CR12","first-page":"219","volume":"5","author":"K. Hashiguchi","year":"2000","unstructured":"Hashiguchi, K., Ichihara, S., Jimbo, S.: Formal languages over free binoids. Journal of Automata, Languages and Combinatorics\u00a05(3), 219\u2013234 (2000)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"19_CR13","series-title":"Semirings and formal power series","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages, ch.9","author":"W. Kuich","year":"1997","unstructured":"Kuich, W.: Word, Language, Grammar. In: Handbook of Formal Languages, ch.9. Semirings and formal power series, vol.\u00a01, pp. 609\u2013677. Springer, Heidelberg (1997)"},{"key":"19_CR14","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. Springer, Heidelberg (1986)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","first-page":"205","volume-title":"CSL 1994","author":"C. Lautemann","year":"1994","unstructured":"Lautemann, C., Schwentick, T., Th\u00e9rien, D.: Logics for context-free languages. In: CSL 1994. LNCS, vol.\u00a0933, pp. 205\u2013216. Springer, Heidelberg (1994)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-73208-2_31","volume-title":"Developments in Language Theory","author":"C. Mathissen","year":"2007","unstructured":"Mathissen, C.: Definable transductions and weighted logics for texts. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 324\u2013336. Springer, Heidelberg (2007)"},{"key":"19_CR17","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":"19_CR18","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)"},{"issue":"4","key":"19_CR19","first-page":"485","volume":"12","author":"S. Schwarz","year":"2007","unstructured":"Schwarz, S.: \u0141ukasiewicz logics and weighted logics over MV-semirings. Journal of Automata, Languages and Combinatorics\u00a012(4), 485\u2013499 (2007)","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:23:30Z","timestamp":1620001410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}