{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T09:42:59Z","timestamp":1737106979384,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434535"},{"type":"electronic","value":"9783540460114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46011-x_3","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:54:16Z","timestamp":1182207256000},"page":"21-36","source":"Crossref","is-referenced-by-count":2,"title":["The Equational Theory of Fixed Points with Applications to Generalized Language Theory"],"prefix":"10.1007","author":[{"given":"Z.","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,19]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"L. Aceto, Z. \u00c9sik and A. Ing\u00f3lfsd\u00f3ttir. A fully equational proof of Parikh\u2019s theorem, BRICS Report Series, RS-01-28, 2001.","DOI":"10.7146\/brics.v8i28.21688"},{"key":"3_CR2","unstructured":"J.W. De Bakker and D. Scott. A theory of programs, IBM Seminar, Vienna, 1969."},{"key":"3_CR3","unstructured":"H. Beki\u0107. Definable operations in general algebra. Technical Report, IBM Laboratory, Vienna, 1969."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1051\/ita\/1998321-300351","volume":"32","author":"L. Bern\u00e1tsky","year":"1998","unstructured":"L. Bern\u00e1tsky and Z. \u00c9sik, Semantics of flowchart programs and the free Conway theories. RAIRO Inform. Th\u00e9or. Appl., 32(1998), 35\u201378.","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1145\/115234.115352","volume":"38","author":"S. L. Bloom","year":"1991","unstructured":"S. L. Bloom and Z. \u00c9sik. Floyd-Hoare logic in iteration theories. J. Assoc. Comput. Mach., 38(1991), 887\u2013934.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-55511-0_24","volume-title":"Program correctness and matricial iteration theories","author":"S. L. Bloom","year":"1992","unstructured":"S. L. Bloom and Z. \u00c9sik. Program correctness and matricial iteration theories. In: Proc. MathematicalFoundations of Programming Semantics\u201991,LNCS 598, Springer-Verlag, 1992, 457\u2013475."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"S. L. Bloom and Z. \u00c9sik. Iteration Theories. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1993.1001","volume":"102","author":"S. L. Bloom","year":"1993","unstructured":"S. L. Bloom, Z. \u00c9sik and D. Taubner. Iteration theories of synchronization trees. Inform. and Comput., 102(1993), 1\u201355.","journal-title":"Inform. and Comput."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"S. Bozapalidis","year":"1999","unstructured":"S. Bozapalidis. Equational elements in additive algebras. Theory Comput. Syst., 32(1999), 1\u201333.","journal-title":"Theory Comput. Syst."},{"key":"3_CR10","unstructured":"J. H. Conway. Regular Algebra and Finite Machines, Chapman and Hall, 1971."},{"key":"3_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-662-21545-6_14","volume-title":"Algorithmes d\u2019\u00e9quivalence et de r\u00e9duction \u00e1 des expressions minimales dans une classe d\u2019\u00e9quations r\u00e9cursives simples","author":"B. Courcelle","year":"1974","unstructured":"B. Courcelle, G. Kahn and J. Vuillemin. Algorithmes d\u2019\u00e9quivalence et de r\u00e9duction \u00e1 des expressions minimales dans une classe d\u2019\u00e9quations r\u00e9cursives simples. In Proc. ICALP 74, Saarbr\u00fccken, LNCS 14, Springer, 200\u2013213."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C. C. Elgot","year":"1978","unstructured":"C. C. Elgot, S. L. Bloom and R. Tindell. On the algebraic structure of rooted trees. J. Comput. System Sci., 16(1978), 362\u2013399.","journal-title":"J. Comput. System Sci."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"J. Engelfriet and E. M. Schmidt. IO and OI. I. J. Comput. System Sci., 15(1977), 328\u2013353.","journal-title":"J. Comput. System Sci."},{"key":"3_CR14","first-page":"183","volume":"14","author":"Z. \u00c9sik","year":"1980","unstructured":"Z. \u00c9sik. Identities in iterative and rational algebraic theories. Comput. Linguist. Comput. Lang., 14(1980), 183\u2013207.","journal-title":"Comput. Linguist. Comput. Lang."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z. \u00c9sik","year":"1997","unstructured":"Z. \u00c9sik. Completeness of Park induction. Theoret. Comput. Sci., 177(1997), 217\u2013283.","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0028581","volume-title":"Axiomatizing the equational theory of regular tree languages","author":"Z. \u00c9sik","year":"1998","unstructured":"Z. \u00c9sik Axiomatizing the equational theory of regular tree languages. In: Proc. STACS 98, Paris, LNCS 1373, Springer, 1998, 455\u2013466."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z. \u00c9sik","year":"1999","unstructured":"Z. \u00c9sik. Group axioms for iteration. Inform. and Comput., 148(1999), 131\u2013180.","journal-title":"Inform. and Comput."},{"key":"3_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-44622-2_20","volume-title":"Axiomatizing the least fixed point operation and binary supremum","author":"Z. \u00c9sik","year":"2000","unstructured":"Z. \u00c9sik. Axiomatizing the least fixed point operation and binary supremum. In: Proc. CSL 2000, LNCS 1862, Springer-Verlag, 302\u2013316."},{"key":"3_CR19","unstructured":"Z. \u00c9sik and H. Lei\u00df. In preparation."},{"key":"3_CR20","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3. Budapest, 1984."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"A. Ginzburg. Algebraic theory of automata. Academic Press, NewYork-London, 1968.","DOI":"10.1016\/B978-1-4832-0013-2.50009-6"},{"key":"3_CR22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. A. Goguen","year":"1977","unstructured":"J. A. Goguen, J. W. Thatcher, E. G. Wagner and J. B. Wright. Initial algebra semantics and continuous algebras. J. Assoc. Comput. Mach., 24(1977), 68\u201395.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"M. W. Hopkins and D. Kozen. Parikh\u2019s theorem in commutative Kleene algebra. In: Proc. IEEE Conf. Logic in Computer Science (LICS\u201999), IEEE Press, July 1999, 394\u2013401.","DOI":"10.1109\/LICS.1999.782634"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In: Proc. 1991 IEEE Symposium on Logic in Computer Science (Amsterdam, 1991), and Inform. and Comput., 110(1994), 366\u2013390.","DOI":"10.1006\/inco.1994.1037"},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1145\/343369.343378","volume":"1","author":"D. Kozen","year":"2000","unstructured":"D. Kozen. On Hoare logic and Kleene algebra with tests. In: Proc. IEEE Conf. Logic in Computer Science (LICS\u201999), IEEE, July 1999, 167\u2013172, and ACM Trans. Computational Logic, 1(2000), 60\u201376.","journal-title":"ACM Trans. Computational Logic"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D. Krob","year":"1991","unstructured":"D. Krob. Complete systems of B-rational identities. Theoret. Comput. Sci., 89(1991), 207\u2013343.","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR27","first-page":"179","volume":"52","author":"I. Takanami","year":"1969","unstructured":"I. Takanami and N. Honda. A characterization of Parikh\u2019s theorem and semilinear sets by commutative semigroups with length. Electronics and Communications in Japan, 52(1969), 179\u2013184.","journal-title":"Electronics and Communications in Japan"},{"key":"3_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-18088-5_17","volume-title":"The Kleene and the Parikh theorem in complete semirings","author":"W. Kuich","year":"1987","unstructured":"W. Kuich. The Kleene and the Parikh theorem in complete semirings. In: Proc. ICALP\u2019 97, LNCS 267, Springer-Verlag, 212\u2013225."},{"key":"3_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1007\/BFb0055801","volume-title":"Gaussian elimination and a characterization of algebraic power series","author":"W. Kuich","year":"1998","unstructured":"W. Kuich. Gaussian elimination and a characterization of algebraic power series. In: Proc. Mathematical Foundations of Computer Science, 1998, LNCS 1450, Springer, Berlin, 1998, 512\u2013521."},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner. A complete inference system for a class of regular behaviors. J. Comput. System Sci., 28(1984), 439\u2013466.","journal-title":"J. Comput. System Sci."},{"key":"3_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-16066-3_16","volume-title":"Computation Theory (Zabor\u00f3w, 1984)","author":"D. Niwinski","year":"1985","unstructured":"D. Niwinski. Equational \u03bc-calculus. In: Computation Theory (Zabor\u00f3w, 1984), LNCS 208, Springer, 1985, 169\u2013176."},{"key":"3_CR32","first-page":"570","volume":"4","author":"R. J. Parikh","year":"1996","unstructured":"R. J. Parikh. esik,zlnemeth@inf.u-szeged.hu On context-free languages. J. Assoc. Comput. Mach., 4(1996), 570\u2013581.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR33","first-page":"59","volume-title":"Machine Intelligence","author":"D. Park","year":"1970","unstructured":"D. Park. Fixpoint induction and proofs of program properties. In: Machine Intelligence, 5, American Elsevier, NewYork, 1970, 59\u201378."},{"key":"3_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Concurrency and automata on infinite sequences","author":"D. Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. In: Proc. GI Conf., LNCS 104, Springer, 1981, 167\u2013183."},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1112\/jlms\/s2-6.4.663","volume":"6","author":"D. L. Pilling","year":"1973","unstructured":"D. L. Pilling. Commutative regular equations and Parikh\u2019s theorem. J. London Math. Soc., 6(1973), 663\u2013666.","journal-title":"J. London Math. Soc."},{"key":"3_CR36","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa. Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach., 13(1966), 158\u2013169.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR37","first-page":"103","volume":"2","author":"J. Tiuryn","year":"1978","unstructured":"J. Tiuryn. Fixed-points and algebras with infinitely long expressions. I. Regular algebras. Fund. Inform., 2(1978\/79), 103\u2013127.","journal-title":"Fund. Inform"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46011-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T09:02:14Z","timestamp":1737104534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46011-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434535","9783540460114"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-46011-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}