{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:18Z","timestamp":1761597018748},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673064"},{"type":"electronic","value":"9783540464150"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719839_36","type":"book-chapter","created":{"date-parts":[[2007,4,11]],"date-time":"2007-04-11T08:13:55Z","timestamp":1176279235000},"page":"367-376","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Iteration Algebras Are Not Finitely Axiomatizable"],"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":[[2007,4,12]]},"reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S0129054192000164","volume":"3","author":"S.L. Bloom","year":"1992","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration algebras. International Journal of Foundations of Computer Science\u00a03(3), 245\u2013302 (1992); Extended abstract in Colloq. on Trees in Algebra and Programming. LNCS, vol. 493, pp. 264\u2013274 (1991)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"36_CR2","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories: The Equational Logic of Iterative Pro-cesses","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative Pro-cesses. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)"},{"key":"36_CR3","doi-asserted-by":"publisher","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"},{"issue":"4-5-6","key":"36_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1051\/ita\/1998324-601751","volume":"32","author":"S.L. Bloom","year":"1998","unstructured":"Bloom, S.L., \u00c9sik, Z.: Shuffle binoids. Theoretical Informatics and Applications\u00a032(4-5-6), 175\u2013198 (1998)","journal-title":"Theoretical Informatics and Applications"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1993.1001","volume":"102","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z., Taubner, D.: Iteration theories of synchronization trees. Information and Computation\u00a0102, 1\u201355 (1993)","journal-title":"Information and Computation"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(88)90020-7","volume":"36","author":"Z. \u00c9sik","year":"1988","unstructured":"\u00c9sik, Z.: Independence of the equational axioms of iteration theories. Journal of Computer and System Sciences\u00a036, 66\u201376 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR7","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":"36_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"Goguen, J., Thatcher, J., Wagner, E., Wright, J.: Initial algebra semantics and continuous algebras. Journal of the ACM\u00a024, 68\u201395 (1977)","journal-title":"Journal of the ACM"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Berlin (1981)"},{"key":"36_CR10","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":"36_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(83)90014-2","volume":"25","author":"E. Nelson","year":"1983","unstructured":"Nelson, E.: Iterative algebras. Theoretical Computer Science\u00a025, 67\u201394 (1983)","journal-title":"Theoretical Computer Science"},{"key":"#cr-split#-36_CR12.1","doi-asserted-by":"crossref","unstructured":"Niwinski, D.: Equational mu-calculus. Computation theory, Zabor\u00f3w (1984)","DOI":"10.1007\/3-540-16066-3_16"},{"key":"#cr-split#-36_CR12.2","unstructured":"Skowron, A. (ed.): SCT 1984. LNCS, vol.\u00a0208. Springer, Heidelberg (1985)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-94-011-0149-3_3","volume-title":"Semigroups, Formal Languages and Groups","author":"D. Perrin","year":"1995","unstructured":"Perrin, D., Pin, J.-E.: Semigroups and automata on infinite words. In: Fountain, J. (ed.) Semigroups, Formal Languages and Groups, pp. 49\u201372. Kluwer Academic Pub., Dordrecht (1995)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"Scott, D.: Data types as lattices. SIAM Journal of Computing\u00a05, 522\u2013587 (1976)","journal-title":"SIAM Journal of Computing"},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-1978-2108","volume":"2","author":"J. Tiuryn","year":"1978","unstructured":"Tiuryn, J.: Fixed points and algebras with infinitely long expressions, I. Regular algebras. Fundamenta Informaticae\u00a02, 103\u2013127 (1978)","journal-title":"Fundamenta Informaticae"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0304-3975(80)90056-0","volume":"12","author":"J. Tiuryn","year":"1980","unstructured":"Tiuryn, J.: Unique fixed points vs. least fixed points. Theoretical Computer Science\u00a012, 229\u2013254 (1980)","journal-title":"Theoretical Computer Science"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/3-540-54233-7_166","volume-title":"Automata, Languages and Programming","author":"T. Wilke","year":"1991","unstructured":"Wilke, T.: An Eilenberg Theorem for \u221e-languages. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 588\u2013599. Springer, Heidelberg (1991)"},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218196793000287","volume":"3","author":"T. Wilke","year":"1993","unstructured":"Wilke, T.: An algebraic theory for regular languages of finite and infinite words. International Journal of Algebra and Computation\u00a03, 447\u2013489 (1993)","journal-title":"International Journal of Algebra and Computation"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF02188010","volume":"21","author":"W. Taylor","year":"1981","unstructured":"Taylor, W.: Hyperidentities and hypervarieties. Aequationes Mathematicae\u00a021, 30\u201349 (1981)","journal-title":"Aequationes Mathematicae"}],"container-title":["Lecture Notes in Computer Science","LATIN 2000: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719839_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T08:18:01Z","timestamp":1628756281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719839_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673064","9783540464150"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/10719839_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"12 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}