{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T04:27:04Z","timestamp":1741926424994,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248962"},{"type":"electronic","value":"9783642248979"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24897-9_4","type":"book-chapter","created":{"date-parts":[[2011,11,5]],"date-time":"2011-11-05T07:47:48Z","timestamp":1320479268000},"page":"72-93","source":"Crossref","is-referenced-by-count":0,"title":["Kleene Theorem in Partial Conway Theories with Applications"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Hajgat\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"A theory of programs","author":"J.W. Bakker de","year":"1969","unstructured":"de Bakker, J.W., Scott, D.: A theory of programs. IBM Seminar, Vienna (1969)"},{"key":"4_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BFb0048939","volume-title":"Programming Languages and their Definition","author":"H. Beki\u0107","year":"1984","unstructured":"Beki\u0107, H.: Definable operations in genaral algebras and the theory of automata and flowcharts. In: Bekic, H. (ed.) Programming Languages and their Definition. LNCS, vol.\u00a0177, pp. 30\u201355. Springer, Heidelberg (1984)"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1051\/ita\/1998321-300351","volume":"32","author":"L. Bern\u00e1tsky","year":"1998","unstructured":"Bern\u00e1tsky, L., \u00c9sik, Z.: Semantics of flowchart programs and the free Conway theories. Theoretical Informatics and Applications, RAIRO\u00a032, 35\u201378 (1998)","journal-title":"Theoretical Informatics and Applications, RAIRO"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science\u00a018, 115\u2013148 (1982)","journal-title":"Theoretical Computer Science"},{"key":"4_CR5","first-page":"26","volume":"9","author":"S.L. Bloom","year":"1980","unstructured":"Bloom, S.L., Elgot, C.C., Wright, J.B.: Solutions of the iteration equation and extension of the scalar iteration operation. SIAM J. Computing\u00a09, 26\u201345 (1980)","journal-title":"SIAM J. Computing"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/0209039","volume":"9","author":"S.L. Bloom","year":"1980","unstructured":"Bloom, S.L., Elgot, C., Wright, J.B.: Vector iteration in pointed iterative theories. SIAM J. Computing\u00a09, 525\u2013540 (1980)","journal-title":"SIAM J. Computing"},{"key":"4_CR7","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":"4_CR8","unstructured":"Bloom, S.L., \u00c9sik, Z.: An extension theorem with an application to formal tree series. J. of Automata, Languages and Combinatorics, 145\u2013185 (2003)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.ic.2009.02.003","volume":"207","author":"S.L. Bloom","year":"2009","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomatizing rational power series over natural numbers. Information and Computation\u00a0207, 793\u2013811 (2009)","journal-title":"Information and Computation"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.3233\/FUN-2008-861-202","volume":"86","author":"S.L. Bloom","year":"2008","unstructured":"Bloom, S.L., \u00c9sik, Z., Kuich, W.: Partial Conway and iteration semirings. Fundamenta Informaticae\u00a086, 19\u201340 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0022-0000(77)80015-9","volume":"14","author":"S.L. Bloom","year":"1977","unstructured":"Bloom, S.L., Ginali, S., Rutledge, J.D.: Scalar and vector iteration. J. Comput. System Sci.\u00a014, 251\u2013256 (1977)","journal-title":"J. Comput. System Sci."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(83)90100-7","volume":"27","author":"S. Bozapalidis","year":"1983","unstructured":"Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theor. Comput. Sci.\u00a027, 211\u2013215 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","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":"4_CR14","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":"4_CR15","first-page":"183","volume":"XIV","author":"Z. \u00c9sik","year":"1980","unstructured":"\u00c9sik, Z.: Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages\u00a0XIV, 183\u2013207 (1980)","journal-title":"Computational Linguistics and Computer Languages"},{"key":"4_CR16","first-page":"95","volume":"XV","author":"Z. \u00c9sik","year":"1982","unstructured":"\u00c9sik, Z.: On generalized iterative algebraic theories. Computational Linguistics and Computer Languages\u00a0XV, 95\u2013110 (1982)","journal-title":"Computational Linguistics and Computer Languages"},{"key":"4_CR17","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":"4_CR18","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":"4_CR19","series-title":"LNCS","first-page":"72","volume-title":"Bozapalidis Festschrift","author":"Z. \u00c9sik","year":"2011","unstructured":"\u00c9sik, Z.: Partial Conway and iteration semiring-semimodule pairs. In: Kuich, W., Rahonis, G. (eds.) Bozapalidis Festschrift. LNCS, vol.\u00a07020, pp. 72\u201393. Springer, Heidelberg (2011)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-03564-7_15","volume-title":"Algebraic Informatics","author":"Z. \u00c9sik","year":"2009","unstructured":"\u00c9sik, Z., Hajgat\u00f3, T.: Iteration grove theories with applications. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol.\u00a05725, pp. 227\u2013249. Springer, Heidelberg (2009)"},{"key":"4_CR21","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Comb.\u00a08, 219\u2013285 (2003)","journal-title":"J. Autom. Lang. Comb."},{"key":"4_CR22","first-page":"203","volume":"10","author":"Z. \u00c9sik","year":"2005","unstructured":"\u00c9sik, Z., Kuich, W.: A semiring-semimodule generalization of \u03c9-regular languages, Parts 1 and 2. J. Automata, Languages, and Combinatorics\u00a010, 203\u2013242, 243\u2013264 (2005)","journal-title":"J. Automata, Languages, and Combinatorics"},{"key":"4_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and Their Applications","author":"J. Golan","year":"1999","unstructured":"Golan, J.: Semirings and Their Applications. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"4_CR24","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3\u201342. Princeton University Press, Princeton (1956)"},{"key":"4_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer, Heidelberg (1986)"},{"key":"4_CR26","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":"4_CR27","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"4_CR28","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":"4_CR29","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":"4_CR30","first-page":"59","volume-title":"Machine Intelligence","author":"D.M.R. Park","year":"1970","unstructured":"Park, D.M.R.: Fixed point induction and proofs of program properties. In: Michie, D., Meltzer, B. (eds.) Machine Intelligence, vol.\u00a05, pp. 59\u201378. Edinburgh Univ. Press, Edinburgh (1970)"},{"key":"4_CR31","first-page":"245","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Computation\u00a04, 245\u2013270 (1961)","journal-title":"Information and Computation"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"885","DOI":"10.2307\/2034080","volume":"13","author":"M.P. Sch\u00fctzenberger","year":"1962","unstructured":"Sch\u00fctzenberger, M.P.: On a theorem of R. Jungen. Proc. American Mathematical Society\u00a013, 885\u2013890 (1962)","journal-title":"Proc. American Mathematical Society"},{"key":"4_CR33","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":"4_CR34","volume-title":"Domains","author":"G. Plotkin","year":"1983","unstructured":"Plotkin, G.: Domains. University of Edinburgh, Edinburgh (1983)"},{"key":"4_CR35","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 Foundations in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24897-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T20:37:31Z","timestamp":1741898251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24897-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248962","9783642248979"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24897-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}