{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:49:10Z","timestamp":1725630550930},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248962"},{"type":"electronic","value":"9783642248979"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24897-9_5","type":"book-chapter","created":{"date-parts":[[2011,11,5]],"date-time":"2011-11-05T07:47:48Z","timestamp":1320479268000},"page":"94-111","source":"Crossref","is-referenced-by-count":0,"title":["Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids"],"prefix":"10.1007","author":[{"given":"Ina","family":"Fichtner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Mathissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. B. G. Teubner, Stuttgart (1979)"},{"key":"5_CR2","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","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.\u00a012. Springer, Heidelberg (1988)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-45007-6_11","volume-title":"Developments in Language Theory","author":"B. Borchardt","year":"2003","unstructured":"Borchardt, B.: The Myhill-Nerode theorem for recognizable tree series. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 146\u2013158. Springer, Heidelberg (2003)"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF01893886","volume":"28","author":"S. Bozapalidis","year":"1991","unstructured":"Bozapalidis, S.: Effective construction of the syntactic algebra of a recognizable series on trees. Acta Informatica\u00a028(4), 351\u2013363 (1991)","journal-title":"Acta Informatica"},{"issue":"4","key":"5_CR5","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":"5_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(83)90100-7","volume":"27","author":"S. Bozapalidis","year":"1983","unstructured":"Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoretical Computer Science\u00a027, 211\u2013215 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0890-5401(03)00066-X","volume":"184","author":"M. Droste","year":"2003","unstructured":"Droste, M., Zhang, G.: On transformations of formal power series. Information and Computation\u00a0184(2), 369\u2013383 (2003)","journal-title":"Information and Computation"},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1017\/S0960129501003395","volume":"11","author":"M. Droste","year":"2001","unstructured":"Droste, M., Kuske, D.: Recognizable languages in divisibility monoids. Mathematical Structures in Computer Science\u00a011(6), 743\u2013770 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR9","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":"5_CR10","series-title":"EATCS Monographs on Theoretical Computer Science","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 series transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. EATCS Monographs on Theoretical Computer Science, ch. 9. Springer, Heidelberg (2009)"},{"key":"5_CR11","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","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 on Theoretical Computer Science, vol.\u00a05. Springer, Heidelberg (1986)"},{"key":"5_CR12","unstructured":"Kuske, D.: Contributions to a Trace Theory beyond Mazurkiewicz Traces. PhD Thesis, Technische Universit\u00e4t Dresden (2000)"},{"key":"5_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0041-0","volume-title":"Algebra","author":"S. Lang","year":"2002","unstructured":"Lang, S.: Algebra. Springer, Heidelberg (2002)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0890-5401(90)90003-Z","volume":"88","author":"M. Pelletier","year":"1990","unstructured":"Pelletier, M., Sakarovitch, J.: Easy multiplications II. Extensions of rational semigroups. Information and Computation\u00a088(1), 18\u201359 (1990)","journal-title":"Information and Computation"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/0021-8693(80)90097-6","volume":"66","author":"C. Reutenauer","year":"1980","unstructured":"Reutenauer, C.: S\u00e9ries formelles et alg\u00e8bres syntactiques. Journal of Algebra\u00a066, 448\u2013483 (1980)","journal-title":"Journal of Algebra"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0890-5401(87)90020-4","volume":"74","author":"J. Sakarovitch","year":"1987","unstructured":"Sakarovitch, J.: Easy multiplications I. The realm of Kleene\u2019s theorem. Information and Computation\u00a074(3), 173\u2013197 (1987)","journal-title":"Information and Computation"},{"key":"5_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"},{"key":"5_CR18","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","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":"5_CR19","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. Information and Control\u00a04, 245\u2013270 (1961)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Algebraic Foundations in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24897-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T16:04:00Z","timestamp":1555344240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24897-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248962","9783642248979"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24897-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}