{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:01Z","timestamp":1725745381156},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406621"},{"type":"electronic","value":"9783642406638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40663-8_17","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T21:03:57Z","timestamp":1376946237000},"page":"173-185","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Equationality"],"prefix":"10.1007","author":[{"given":"Symeon","family":"Bozapalidis","sequence":"first","affiliation":[]},{"given":"George","family":"Rahonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a018, 115\u2013148 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR2","first-page":"145","volume":"8","author":"S.L. Bloom","year":"2003","unstructured":"Bloom, S.L., \u00c9sik, Z.: An extension theorem with an application to formal tree series. J. Autom. Lang. Comb.\u00a08, 145\u2013185 (2003)","journal-title":"J. Autom. Lang. Comb."},{"key":"17_CR3","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 Comput. Syst.\u00a032, 1\u201333 (1999)","journal-title":"Theory of Comput. Syst."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1016\/j.tcs.2011.03.028","volume":"412","author":"S. Bozapalidis","year":"2011","unstructured":"Bozapalidis, S., F\u00fcl\u00f6p, Z., Rahonis, G.: Equational tree transformations. Theoret. Comput. Sci.\u00a0412, 3676\u20133692 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00236-011-0148-5","volume":"49","author":"S. Bozapalidis","year":"2012","unstructured":"Bozapalidis, S., F\u00fcl\u00f6p, Z., Rahonis, G.: Equational weighted tree transformations. Acta Inform.\u00a049, 29\u201352 (2012)","journal-title":"Acta Inform."},{"key":"17_CR6","first-page":"185","volume":"10","author":"S. Bozapalidis","year":"2005","unstructured":"Bozapalidis, S., Rahonis, G.: On the closure of recognizable tree series under tree homomorphisms. J. Autom. Lang. Comb.\u00a010, 185\u2013202 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"17_CR7","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Comb.\u00a08, 219\u2013285 (2003)","journal-title":"J. Autom. Lang. Comb."},{"key":"17_CR8","unstructured":"Esparza, J., Gaizer, A., Kiefer, S.: Computing least fixed points of probabilistic systems of polynomilas. In: Proceedings of STACS 2010. LIPIcs, vol.\u00a05, pp. 359\u2013370. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2010)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462154","volume":"56","author":"K. Etessami","year":"2009","unstructured":"Etessami, K., Yannakakis, M.: Recursice Markov chains, stochastic grammars, and monotone systems of non-linear equations. J. ACM\u00a056, 1\u201366 (2009)","journal-title":"J. ACM"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1145\/2213977.2214030","volume-title":"Proceedings of the 44th Symposium on Theory of Computing, STOC 2012","author":"K. Etessami","year":"2012","unstructured":"Etessami, K., Stewart, A., Yannakakis, M.: Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 579\u2013588. ACM, New York (2012)"},{"issue":"2","key":"17_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2159531.2159534","volume":"13","author":"K. Etessami","year":"2012","unstructured":"Etessami, K., Yannakakis, M.: Model checking of recursive probabilistic systems. ACM Trans. Comput. Logic\u00a013(2), 12:1\u201312:40 (2012)","journal-title":"ACM Trans. Comput. Logic"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-24897-9_6","volume-title":"Algebraic Foundations in Computer Science","author":"Z. F\u00fcl\u00f6p","year":"2011","unstructured":"F\u00fcl\u00f6p, Z., Rahonis, G.: Equational weighted tree transformations with discounting. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol.\u00a07020, pp. 112\u2013145. Springer, Heidelberg (2011)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Handbook of Weighted Automata. Monographs in Theoretical Computer Science, An EATCS Series, pp. 313\u2013404. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_9"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/3-540-44612-5_44","volume-title":"Mathematical Foundations of Computer Science 2000","author":"W. Kuich","year":"2000","unstructured":"Kuich, W.: Formal series over algebras. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 488\u2013496. Springer, Heidelberg (2000)"},{"key":"17_CR15","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. Inform. Control\u00a011, 3\u201329 (1967)","journal-title":"Inform. Control"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Wechler, W.: Universal Algebra for Computer Scientists. EATCS Monographs on Theoretical Computer Science, vol.\u00a025. Springer (1992)","DOI":"10.1007\/978-3-642-76771-5"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40663-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:28:28Z","timestamp":1558016908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40663-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406621","9783642406638"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40663-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}