{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:21:18Z","timestamp":1743060078225,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_1","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"1-20","source":"Crossref","is-referenced-by-count":5,"title":["Iteration Semirings"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","first-page":"67","volume":"10","author":"K.B. Arhangelsky","year":"1987","unstructured":"Arhangelsky, K.B., Gorshkov, P.V.: Implicational axioms for the algebra of regular languages (in Russian). Doklady Akad. Nauk, USSR, ser A.\u00a010, 67\u201369 (1987)","journal-title":"Doklady Akad. Nauk, USSR, ser A."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/11523468_33","volume-title":"Automata, Languages and Programming","author":"M.-P. B\u00e9al","year":"2005","unstructured":"B\u00e9al, M.-P., Lombardy, S., Sakarovitch, J.: On the equivalence of \u2124-automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 397\u2013409. Springer, Heidelberg (2005)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11753728_9","volume-title":"Computer Science \u2013 Theory and Applications","author":"M.-P. B\u00e9al","year":"2006","unstructured":"B\u00e9al, M.-P., Lombardy, S., Sakarovitch, J.: Conjugacy and equivalence of weighted automata and functional transducers. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 58\u201369. Springer, Heidelberg (2006)"},{"key":"1_CR4","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. Springer, Heidelberg (1988), October 19, 2007, http:\/\/www-igm.univ-mlv.fr\/berstel\/"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129500000104","volume":"3","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Equational axioms for regular sets. Mathematical Structures in Computer Science\u00a03, 1\u201324 (1993)","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR6","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories: The Equational Logic of Iterative Processes","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)"},{"key":"1_CR7","first-page":"150","volume":"59","author":"S.L. Bloom","year":"1996","unstructured":"Bloom, S.L., \u00c9sik, Z.: Two axiomatizations of a star semiring quasi-variety. EATCS Bulletin\u00a059, 150\u2013152 (1996)","journal-title":"EATCS Bulletin"},{"key":"1_CR8","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomatizing rational power series (to appear)"},{"key":"1_CR9","unstructured":"Bloom, S.L., \u00c9sik, Z., Kuich, W.: Partial Conway and iteration theories, Fundamenta Informaticae (to appear)"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1990240404191","volume":"24","author":"M. Boffa","year":"1990","unstructured":"Boffa, M.: A remark on complete systems of rational identities (French). RAIRO Inform. Theor. Appl.\u00a024, 419\u2013423 (1990)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1051\/ita\/1995290605151","volume":"29","author":"M. Boffa","year":"1995","unstructured":"Boffa, M.: A condition implying all rational identities (French). RAIRO Inform. Theor. Appl.\u00a029, 515\u2013518 (1995)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"1_CR12","first-page":"167","volume":"7","author":"P. Bouyer","year":"2001","unstructured":"Bouyer, P., Petit, A.: A Kleene\/B\u00fcchi-like theorem for clock languages. J. Automata, Languages and Combinatorics\u00a07, 167\u2013181 (2001)","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"1_CR13","volume-title":"Regular Algebra and Finite Machines","author":"J.C. Conway","year":"1971","unstructured":"Conway, J.C.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1093\/logcom\/12.2.301","volume":"12","author":"F. Corradini","year":"2002","unstructured":"Corradini, F., De Nicola, R., Labella, A.: An equational axiomatization of bisimulation over regular expressions. J. Logic Comput.\u00a012, 301\u2013320 (2002)","journal-title":"J. Logic Comput."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-78499-9_11","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Droste","year":"2008","unstructured":"Droste, M., Quaas, K.: A Kleene-Sch\u00fctzenberger theorem for weighted timed automata. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 127\u2013141. Springer, Heidelberg (2008)"},{"key":"1_CR16","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":"1_CR17","first-page":"175","volume-title":"Logic Colloquium 1973, Studies in Logic","author":"C.C. Elgot","year":"1975","unstructured":"Elgot, C.C.: Monadic computation and iterative algebraic theories. In: Logic Colloquium 1973, Studies in Logic, vol.\u00a080, pp. 175\u2013230. North Holland, Amsterdam (1975)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C. Elgot","year":"1978","unstructured":"Elgot, C., Bloom, S.L., Tindell, R.: On the algebraic structure of rooted trees. J. Comput. System Sci.\u00a016, 362\u2013399 (1978)","journal-title":"J. Comput. System Sci."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z. \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z.: Group axioms for iteration. Information and Computation\u00a0148, 131\u2013180 (1999)","journal-title":"Information and Computation"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1142\/9789812810908_0008","volume-title":"Words, Semigroups, and Transductions","author":"Z. \u00c9sik","year":"2001","unstructured":"\u00c9sik, Z., Kuich, W.: A generalization of Kozen\u2019s axiomatization of the equational theory of the regular sets. In: Words, Semigroups, and Transductions, pp. 99\u2013114. World Scientific, Singapore (2001)"},{"key":"1_CR21","first-page":"173","volume":"8","author":"Z. \u00c9sik","year":"2002","unstructured":"\u00c9sik, Z., Kuich, W.: Rationally additive semirings. J. UCS\u00a08, 173\u2013183 (2002)","journal-title":"J. UCS"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.03.050","volume":"324","author":"Z. \u00c9sik","year":"2004","unstructured":"\u00c9sik, Z., Kuich, W.: Inductive *-semirings. Theoret. Comput. Sci.\u00a0324, 3\u201333 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Goguen, J., Thatcher, J., Wagner, E., Wright, J.: Initial algebra semantics and continuous algebras. J. ACM (24), 68\u201395 (1977)","DOI":"10.1145\/321992.321997"},{"key":"1_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and their Applications","author":"J.S. Golan","year":"1999","unstructured":"Golan, J.S.: Semirings and their Applications. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"1_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal Algebra","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"Gr\u00e4tzer, G.: Universal Algebra. Springer, Heidelberg (1979)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10284-1","volume-title":"Algebraic Semantics","author":"I. Guessarian","year":"1981","unstructured":"Guessarian, I.: Algebraic Semantics. LNCS, vol.\u00a099. Springer, Heidelberg (1981)"},{"key":"1_CR27","first-page":"55","volume":"31","author":"U. Hebisch","year":"1990","unstructured":"Hebisch, U.: A Kleene theorem in countably complete semirings. Bayreuth. Math. Schr.\u00a031, 55\u201366 (1990)","journal-title":"Bayreuth. Math. Schr."},{"key":"1_CR28","first-page":"661","volume-title":"Information processing 74 (Proc. IFIP Congress, Stockholm, 1974)","author":"T. Ito","year":"1974","unstructured":"Ito, T., Ando, S.: A complete axiom system of super-regular expressions. In: Information processing 74 (Proc. IFIP Congress, Stockholm, 1974), pp. 661\u2013665. North-Holland, Amsterdam (1974)"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BF03025757","volume":"45","author":"G. Karner","year":"1992","unstructured":"Karner, G.: On limits in complete semirings. Semigroup Forum\u00a045, 148\u2013165 (1992)","journal-title":"Semigroup Forum"},{"key":"1_CR30","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events, Technical report, Cornell University, Department of Computer Science (1990)"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inform. and Comput.\u00a0110, 366\u2013390 (1994)","journal-title":"Inform. and Comput."},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF02575025","volume":"3","author":"D. Krob","year":"1987","unstructured":"Krob, D.: Complete semirings and monoids (French). Semigroup Forum\u00a03, 323\u2013329 (1987)","journal-title":"Semigroup Forum"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02573124","volume":"37","author":"D. Krob","year":"1988","unstructured":"Krob, D.: Continuous semirings and monoids (French). Semigroup Forum\u00a037, 59\u201378 (1988)","journal-title":"Semigroup Forum"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D. Krob","year":"1991","unstructured":"Krob, D.: Complete systems of B-rational identities. Theoretical Computer Science\u00a089, 207\u2013343 (1991)","journal-title":"Theoretical Computer Science"},{"key":"1_CR35","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1051\/ita\/1991250504231","volume":"25","author":"D. Krob","year":"1991","unstructured":"Krob, D.: Matrix versions of aperiodic K-rational identities. Theoretical Informatics and Applications\u00a025, 423\u2013444 (1991)","journal-title":"Theoretical Informatics and Applications"},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. J. Comput. System Sci.\u00a028, 439\u2013466 (1984)","journal-title":"J. Comput. System Sci."},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R. Milner","year":"1989","unstructured":"Milner, R.: A complete axiomatisation for observational congruence of finite-state behaviours. Inform. and Comput.\u00a081, 227\u2013247 (1989)","journal-title":"Inform. and Comput."},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(80)90038-9","volume":"11","author":"M. Morisaki","year":"1980","unstructured":"Morisaki, M., Sakai, K.: A complete axiom system for rational sets with multiplicity. Theoretical Computer Science\u00a011, 79\u201392 (1980)","journal-title":"Theoretical Computer Science"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/3-540-58027-1_25","volume-title":"Mathematical Foundations of Programming Semantics 1993","author":"A. Rabinovitch","year":"1994","unstructured":"Rabinovitch, A.: A complete axiomatisation for trace congruence of finite state behaviors. In: Mathematical Foundations of Programming Semantics 1993. LNCS, vol.\u00a0802, pp. 530\u2013543. Springer, Heidelberg (1994)"},{"key":"1_CR40","first-page":"120","volume":"16","author":"V.N. Redko","year":"1964","unstructured":"Redko, V.N.: On the determining totality of relations of an algebra of regular events (in Russian). Ukrainian Math. \u017d.\u00a016, 120\u2013126 (1964)","journal-title":"Ukrainian Math. \u017d."},{"key":"1_CR41","first-page":"185","volume":"16","author":"V.N. Redko","year":"1964","unstructured":"Redko, V.N.: On algebra of commutative events (in Russian). Ukrainian Math. \u017d.\u00a016, 185\u2013195 (1964)","journal-title":"Ukrainian Math. \u017d."},{"key":"1_CR42","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. Journal of the Association for Computing Machinery\u00a013, 158\u2013169 (1966)","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T22:03:28Z","timestamp":1684533808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}