{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:54Z","timestamp":1725536334577},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03564-7_15","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T03:05:35Z","timestamp":1250737535000},"page":"227-249","source":"Crossref","is-referenced-by-count":1,"title":["Iteration Grove Theories with Applications"],"prefix":"10.1007","author":[{"given":"Z.","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"T.","family":"Hajgat\u00f3","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BFb0048939","volume-title":"Definable operations in genaral algebras and the theory of automata and flowcharts","author":"H. Beki\u0107","year":"1984","unstructured":"Beki\u0107, H.: Definable operations in genaral algebras and the theory of automata and flowcharts. LNCS, vol.\u00a0177, pp. 30\u201355. Springer, Heidelberg (1984)"},{"key":"15_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. Springer, Heidelberg (1993)"},{"key":"15_CR3","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. of Automata, Languages and Combinatorics\u00a08, 145\u2013185 (2003)","journal-title":"J. of Automata, Languages and Combinatorics"},{"key":"15_CR4","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. Sys.\u00a032, 1\u201333 (1999)","journal-title":"Theory of Comput. Sys."},{"key":"15_CR5","unstructured":"de Bakker, J.W., Scott, D.: A theory of programs. IBM Seminar, Vienna (1969)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J., Schmidt, E.M.: IO and OI. I. and II. J. Comput. System Sci.\u00a015, 328\u2013353 (1977); 16, 67\u201399 (1978)","journal-title":"J. Comput. System Sci."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0021-8693(76)90106-X","volume":"42","author":"C.C. Elgot","year":"1976","unstructured":"Elgot, C.C.: Matricial theories. J. Algebra\u00a042, 391\u2013421 (1976)","journal-title":"J. Algebra"},{"key":"15_CR8","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0049-237X(08)71949-9","volume-title":"Logic Colloquium 1973","author":"C.C. Elgot","year":"1975","unstructured":"Elgot, C.C.: Monadic computation and iterative algebraic theories. In: Logic Colloquium 1973, Bristol. Studies in Logic and the Foundations of Mathematics, vol.\u00a080, pp. 175\u2013230. North-Holland, Amsterdam (1975)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z. \u00c9sik","year":"1997","unstructured":"\u00c9sik, Z.: Completeness of Park induction. Theoret. Comput. Sci.\u00a0177, 217\u2013283 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0028581","volume-title":"STACS 98","author":"Z. \u00c9sik","year":"1998","unstructured":"\u00c9sik, Z.: Axiomatizing the equational theory of regular tree languages (extended abstract). In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 455\u2013465. Springer, Heidelberg (1998)"},{"key":"15_CR11","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":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-44622-2_20","volume-title":"Computer Science Logic","author":"Z. \u00c9sik","year":"2000","unstructured":"\u00c9sik, Z.: Axiomatizing the least fixed point operation and binary supremum. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 302\u2013316. Springer, Heidelberg (2000)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1093\/logcom\/12.2.271","volume":"12","author":"Z. \u00c9sik","year":"2002","unstructured":"\u00c9sik, Z.: Continuous additive algebras and injective simulations of synchronization trees. J. Logic and Comutation\u00a012, 271\u2013300 (2002)","journal-title":"J. Logic and Comutation"},{"key":"15_CR14","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"15_CR15","unstructured":"Kuich, W.: Linear systems of equations and automata on distributive multioperator monoids. In: Contributions to general algebra 12, Vienna, 1999, Heyn, Klagenfurt, pp. 247\u2013256 (2000)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F.W. Lawvere","year":"1963","unstructured":"Lawvere, F.W.: Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. U.S.A.\u00a050, 869\u2013872 (1963)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-16066-3_16","volume-title":"Computation Theory","author":"D. Niwinski","year":"1985","unstructured":"Niwinski, D.: Equational \u03bc-calculus. In: Skowron, A. (ed.) SCT 1984. LNCS, vol.\u00a0208, pp. 169\u2013176. Springer, Heidelberg (1985)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-16761-7_96","volume-title":"Automata, Languages and Programming","author":"D. Niwinski","year":"1986","unstructured":"Niwinski, D.: On fixed-point clones (extended abstract). In: Kott, L. (ed.) ICALP 1986. LNCS, vol.\u00a0226, pp. 464\u2013473. Springer, Heidelberg (1986)"},{"key":"15_CR19","unstructured":"Park, D.M.R.: Fixed point induction and proofs of program properties. In: Michie, D., Meltzer, B. (eds.) Machine Intelligence 5, pp. 59\u201378. Edinburgh Univ. Press (1970)"},{"key":"15_CR20","unstructured":"Plotkin, G.: Domains. Univeristy of Edinburgh (1983)"},{"key":"15_CR21","first-page":"30","volume-title":"15th Annual IEEE Symposium on Logic in Computer Science","author":"A. Simpson","year":"2000","unstructured":"Simpson, A., Plotkin, G.: Complete axioms for categorical fixed-point operators. In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, pp. 30\u201341. IEEE Comput. Soc. Press, Los Alamitos (2000)"},{"key":"15_CR22","first-page":"147","volume-title":"17th Annual Symposium on Foundations of Computer Science","author":"J.B. Wright","year":"1976","unstructured":"Wright, J.B., Thatcher, J.W., Wagner, E.G., Goguen, J.A.: Rational algebraic theories and fixed-point solutions. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Tex, pp. 147\u2013158. IEEE Comput. Soc, Long Beach (1976)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:44:20Z","timestamp":1552121060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}