{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:21Z","timestamp":1761611301460},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583387"},{"type":"electronic","value":"9783540486633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:51:31Z","timestamp":1330271491000},"page":"52-67","source":"Crossref","is-referenced-by-count":8,"title":["Solving polynomial fixed point equations"],"prefix":"10.1007","author":[{"given":"Stephen L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"4_CR1","first-page":"67","volume":"10","author":"K. B. Arkhangelskii","year":"1987","unstructured":"K. B. Arkhangelskii and P. V. Gorshkov. Implicational axioms for the algebra of regular languages (in Russian). Doklady Akad. Nauk, USSR, ser A., 10:67\u201369, 1987.","journal-title":"Doklady Akad. Nauk, USSR, ser A"},{"key":"4_CR2","unstructured":"S. L. Bloom and Z. \u00c9sik. Fixed point operations on ccc's, Part I. To appear."},{"key":"4_CR3","unstructured":"S. L. Bloom and Z. \u00c9sik. Some equational laws of initiality in 2ccc's. To appear."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1142\/S0129054192000164","volume":"3","author":"S. L. Bloom","year":"1992","unstructured":"S. L. Bloom and Z. \u00c9sik. Iteration algebras. International Journal of Foundations of Computer Science, 3:245\u2013302, 1992.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"S. L. Bloom and Z. \u00c9sik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"S. L. Bloom and Z. \u00c9sik. Some quasi-varieties of iteration theories. In: Proceedings of Mathematical Foundations of Programming Semantics '93, LNCS, to appear.","DOI":"10.1007\/3-540-58027-1_19"},{"key":"4_CR7","unstructured":"J. C. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0022-0000(83)90044-2","volume":"27","author":"Z. \u00c9sik","year":"1983","unstructured":"Z. \u00c9sik. Algebras of iteration theories. Journal of Computer and System Sciences, 27:291\u2013303, 1983.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(88)90020-7","volume":"36","author":"Z. \u00c9sik","year":"1988","unstructured":"Z. \u00c9sik. Independence of the equational axioms of iteration theories. Journal of Computer and System Sciences, 36:66\u201376, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR10","unstructured":"Z. \u00c9sik and L. Bern\u00e1tsky. Scott induction and equational proofs. To appear."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/0213047","volume":"13","author":"J. Gallier","year":"1984","unstructured":"J. Gallier. N-rational algebras: Parts I and II. SIAM Journal of Computing, 13:750\u2013775, 776\u2013794, 1984.","journal-title":"SIAM Journal of Computing"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"J. Goguen, J. Thatcher, E. Wagner, and J. Wright. Initial algebra semantics and continuous algebras. Journal of the Association for Computing Machinery, 24:68\u201395, 1977.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In Proc. IEEE Symposium on Logic in Computer Science, pages 214\u2013225, 1991.","DOI":"10.1109\/LICS.1991.151646"},{"key":"4_CR14","doi-asserted-by":"crossref","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. Theoretical Computer Science, 89:207\u2013343, 1991.","journal-title":"Theoretical Computer Science"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"E. G. Manes. Predicate Transformer Semantics. Cambridge Tracts in Theoretical Computer Science 31. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511569821"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(83)90014-2","volume":"25","author":"E. Nelson","year":"1983","unstructured":"E. Nelson. Iterative algebras. Theoretical Computer Science, 25:67\u201394, 1983.","journal-title":"Theoretical Computer Science"},{"key":"4_CR17","unstructured":"G. Plotkin. Domains. Department of Computer Science, University of Edinburgh, 1983."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-1978-2108","volume":"2","author":"J. Tiuryn","year":"1978","unstructured":"J. Tiuryn. Fixed points and algebras with infinitely long expressions, Parts I and II, Fundamenta Informaticae 2:103\u2013127, 1978, 317\u2013335, 1979.","journal-title":"Fundamenta Informaticae"},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(80)90056-0","volume":"12","author":"J. Tiuryn","year":"1980","unstructured":"J. Tiuryn. Unique fixed points vs. least fixed points. Theoretical Computer Science, 12:229\u2013254, 1980.","journal-title":"Theoretical Computer Science"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"G. Winskel. The Formal Semantics of Programming Languages. MIT Press, 1993.","DOI":"10.7551\/mitpress\/3054.001.0001"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"J. B. Wright, J. W. Thatcher, J. Goguen, and E. G. Wagner. Rational algebraic theories and fixed-point solutions. In Proceedings 17th IEEE Symposium on Foundations of Computing, pages 147\u2013158, Houston, Texas, 1976.","DOI":"10.1109\/SFCS.1976.24"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:55:14Z","timestamp":1640933714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}