{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:43Z","timestamp":1725491443368},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_31","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T03:58:11Z","timestamp":1189569491000},"page":"324-336","source":"Crossref","is-referenced-by-count":14,"title":["Definable Transductions and Weighted Logics for Texts"],"prefix":"10.1007","author":[{"given":"Christian","family":"Mathissen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"S. Bozapalidis","year":"1999","unstructured":"Bozapalidis, S.: Equational elements in additive algebras. Theory of Computing Systems\u00a032(1), 1\u201333 (1999)","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"31_CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1051\/ita\/1989230404491","volume":"23","author":"S. Bozapalidis","year":"1989","unstructured":"Bozapalidis, S., Alexandrakis, A.: Repr\u00e9sentations matricielles des s\u00e9ries d\u2019arbre reconnaissables. Theoretical Informatics and Applications\u00a023(4), 449\u2013459 (1989)","journal-title":"Theoretical Informatics and Applications"},{"key":"31_CR3","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":"31_CR4","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences\u00a04, 406\u2013451 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/11523468_42","volume-title":"Automata, Languages and Programming","author":"M. Droste","year":"2005","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 513\u2013525. Springer, Heidelberg (2005)"},{"key":"31_CR6","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":"31_CR7","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"},{"key":"31_CR8","doi-asserted-by":"crossref","DOI":"10.1142\/4197","volume-title":"The Theory of 2-structures: A Framework for Decomposition and Transformation of Graphs","author":"A. Ehrenfeucht","year":"1999","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-structures: A Framework for Decomposition and Transformation of Graphs. World Scientific, Singapore (1999)"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures. I and II. Theoretical Computer Science\u00a070, 277\u2013342 (1990)","journal-title":"Theoretical Computer Science"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(93)90323-L","volume":"116","author":"A. Ehrenfeucht","year":"1993","unstructured":"Ehrenfeucht, A., Rozenberg, G.: T-structures, T-functions, and texts. Theoretical Computer Science\u00a0116, 227\u2013290 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01192159","volume":"31","author":"A. Ehrenfeucht","year":"1994","unstructured":"Ehrenfeucht, A., ten Pas, P., Rozenberg, G.: Context-free text grammars. Acta Informatica\u00a031(2), 161\u2013206 (1994)","journal-title":"Acta Informatica"},{"issue":"1","key":"31_CR12","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":"31_CR13","first-page":"219","volume":"5","author":"K. Hashiguchi","year":"2000","unstructured":"Hashiguchi, K., Ichihara, S., Jimbo, S.: Formal languages over free bionoids. Journal of Automata, Languages and Combinatorics\u00a05(3), 219\u2013234 (2000)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"3","key":"31_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1996-253409","volume":"25","author":"H.J. Hoogeboom","year":"1996","unstructured":"Hoogeboom, H.J., ten Pas, P.: Text languages in an algebraic framework. Fundamenta Informaticae\u00a025(3), 353\u2013380 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"31_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF02679464","volume":"30","author":"H.J. Hoogeboom","year":"1997","unstructured":"Hoogeboom, H.J., ten Pas, P.: Monadic second-order definable text languages. Theory of Computing Systems\u00a030, 335\u2013354 (1997)","journal-title":"Theory of Computing Systems"},{"key":"31_CR16","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":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"issue":"1\/2","key":"31_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control\u00a011(1\/2), 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/0021-8693(80)90097-6","volume":"66","author":"C.. Reutenauer","year":"1980","unstructured":"Reutenauer, Ch.: S\u00e9ries formelles et alg\u00e8bres syntactiques. J. Algebra\u00a066, 448\u2013483 (1980)","journal-title":"J. Algebra"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:12:29Z","timestamp":1605744749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}