{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:46Z","timestamp":1725905446198},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_15","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"210-221","source":"Crossref","is-referenced-by-count":0,"title":["A Medvedev Characterization of Recognizable Tree Series"],"prefix":"10.1007","author":[{"given":"Luisa","family":"Herrmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18(2), 115\u2013148 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR2","series-title":"EATCS Monographs on 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 on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)"},{"issue":"4","key":"15_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.3233\/FI-1994-2146","volume":"21","author":"S Bozapalidis","year":"1994","unstructured":"Bozapalidis, S.: Representable tree series. Fundam. Inf. 21(4), 367\u2013389 (1994)","journal-title":"Fundam. Inf."},{"issue":"1\u20132","key":"15_CR4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01706094","volume":"6","author":"OL Costich","year":"1972","unstructured":"Costich, O.L.: A Medvedev characterization of sets recognized by generalized finite automata. Math. Syst. Theor. 6(1\u20132), 263\u2013267 (1972)","journal-title":"Math. Syst. Theor."},{"issue":"1","key":"15_CR5","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), 69\u201386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi: 10.1007\/978-3-642-24897-9_2"},{"key":"15_CR7","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, 228\u2013247 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s00224-009-9224-4","volume":"48","author":"M Droste","year":"2011","unstructured":"Droste, M., Vogler, H.: Weighted logics for unranked tree automata. Theor. Comput. Syst. 48(1), 23\u201347 (2011)","journal-title":"Theor. Comput. Syst."},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-642-01492-5_9","volume-title":"Handbook of Weighted Automata","author":"Z F\u00fcl\u00f6p","year":"2009","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 313\u2013403. Springer, Heidelberg (2009)"},{"key":"15_CR10","unstructured":"Medvedev, Y.T.: On the class of events representable in a finite automaton. Automata Studies (1956). Also in Sequential machines - Selected papers (translated from Russian), pp. 215\u2013227. Addison-Wesley (1964)"}],"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-319-62809-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T01:19:26Z","timestamp":1602551966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}