{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T11:40:09Z","timestamp":1734176409153,"version":"3.30.2"},"reference-count":30,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1051\/ita:2002007","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T16:49:42Z","timestamp":1068828582000},"page":"129-153","source":"Crossref","is-referenced-by-count":6,"title":["A Fully Equational Proof of Parikh's Theorem"],"prefix":"10.1051","volume":"36","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,12,15]]},"reference":[{"unstructured":"H. Bekic,Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report. IBM Laboratory, Vienna (1969).","key":"R1"},{"key":"R2","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1145\/115234.115352","volume":"38","author":"Bloom","year":"1991","journal-title":"J. Assoc. Comput. Mach."},{"doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik, Program correctness and matricial iteration theories, inProc. Mathematical Foundations of Programming Semantics'91. Springer-Verlag,Lecture Notes in Comput. Sci.598(1992) 457-475.","key":"R3","DOI":"10.1007\/3-540-55511-0_24"},{"doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik,Iteration Theories. Springer-Verlag (1993).","key":"R4","DOI":"10.1007\/978-3-642-78034-9"},{"key":"R5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"Bozapalidis","year":"1999","journal-title":"Theory Comput. Syst."},{"unstructured":"J. Conway,Regular Algebra and Finite Machines. Chapman and Hall (1971).","key":"R6"},{"unstructured":"J.W. De Bakker and D. Scott, A theory of programs, inIBM Seminar. Vienna (1969).","key":"R7"},{"key":"R8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"\u00c9sik","year":"1999","journal-title":"Inform. and Comput."},{"unstructured":"Z. \u00c9sik and H. Leiss, Greibach normal form in algebraically complete semirings, inProc. Annual Conference of the European Association for Computer Science Logic, CSL'02. Springer,Lecture Notes in Comput. Sci.(to appear).","key":"R9"},{"doi-asserted-by":"crossref","unstructured":"S. Ginsburg,The Mathematical Theory of Context-Free Languages. McGraw-Hill (1966).","key":"R10","DOI":"10.1145\/321312.321318"},{"doi-asserted-by":"crossref","unstructured":"A. Ginzburg,Algebraic Theory of Automata. Academic Press, New York-London (1968).","key":"R11","DOI":"10.1016\/B978-1-4832-0013-2.50009-6"},{"doi-asserted-by":"crossref","unstructured":"J.S. Golan,Semirings and their Applications. Kluwer Academic Publishers, Dordrecht (1999).","key":"R12","DOI":"10.1007\/978-94-015-9333-5"},{"unstructured":"J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages, and Computation.Addison-Wesley, Reading, Mass. (1979).","key":"R13"},{"doi-asserted-by":"crossref","unstructured":"M.W. Hopkins and D. Kozen, Parikh's theorem in commutative Kleene algebra, inProc. IEEE Conf. Logic in Computer Science (LICS'99). IEEE Press (1999) 394-401.","key":"R14","DOI":"10.1109\/LICS.1999.782634"},{"key":"R15","first-page":"291","volume":"18","author":"Huynh","year":"1982","journal-title":"Elektron. Informationsverarb. Kybernet"},{"key":"R16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0019-9958(85)80015-2","volume":"66","author":"Huynh","year":"1985","journal-title":"Inform. and Control"},{"key":"R17","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"Kozen","year":"1994","journal-title":"Inform. and Comput."},{"doi-asserted-by":"crossref","unstructured":"D. Kozen, On Hoare logic and Kleene algebra with tests, inProc. IEEE Conf. Logic in Computer Science (LICS'99). IEEE Press (1999) 167-172.","key":"R18","DOI":"10.1109\/LICS.1999.782610"},{"key":"R19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"Krob","year":"1991","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"W. Kuich, The Kleene and the Parikh theorem in complete semirings, inProc. ICALP '87. Springer-Verlag,Lecture Notes in Comput. Sci.267(1987) 212-225.","key":"R20","DOI":"10.1007\/3-540-18088-5_17"},{"doi-asserted-by":"crossref","unstructured":"W. Kuich, Gaussian elimination and a characterization of algebraic power series, inProc. Mathematical Foundations of Computer Science, 1998. Springer, Berlin,Lecture Notes in Comput. Sci.1450(1998) 512-521.","key":"R21","DOI":"10.1007\/BFb0055801"},{"doi-asserted-by":"crossref","unstructured":"W. Kuich and A. Salomaa,Semirings, Automata, Languages.Springer-Verlag, Berlin (1986).","key":"R22","DOI":"10.1007\/978-3-642-69959-7"},{"doi-asserted-by":"crossref","unstructured":"E.G. Manes and M.A. Arbib,Algebraic Approaches to Program Semantics. Springer-Verlag, New York (1986).","key":"R23","DOI":"10.1007\/978-1-4612-4962-7"},{"unstructured":"D. Niwinski, On fixed-point clones (extended abstract), inAutomata, Languages and Programming, Rennes, 1986. Springer,Lecture Notes in Comput. Sci.226(1986) 464-473.","key":"R24"},{"key":"R25","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"Parikh","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"unstructured":"D.M.R. Park, Fixed point induction and proofs of program properties, inMachine Intelligence, Vol. 5. Edinburgh Univ. Press (1970) 59-78.","key":"R26"},{"key":"R27","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1112\/jlms\/s2-6.4.663","volume":"6","author":"Pilling","year":"1973","journal-title":"J. London Math. Soc."},{"unstructured":"V.N. Redko, On the algebra of commutative events. (Russian)Ukrain. Mat. Z.16(1964) 185-195.","key":"R28"},{"unstructured":"A. Salomaa,Theory of Automata. Pergamon Press (1969).","key":"R29"},{"key":"R30","first-page":"179","volume":"52","author":"Takanami","year":"1969","journal-title":"Electron. Comm. Japan"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002007\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T11:04:12Z","timestamp":1734174252000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":30,"journal-issue":{"issue":"2"},"alternative-id":["ita0215"],"URL":"https:\/\/doi.org\/10.1051\/ita:2002007","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}