{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:08:49Z","timestamp":1649016529634},"reference-count":35,"publisher":"EDP Sciences","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1051\/ita:1999127","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:07:12Z","timestamp":1068822432000},"page":"447-465","source":"Crossref","is-referenced-by-count":4,"title":["A Finite Axiomatization of Nondeterministic Regular Expressions"],"prefix":"10.1051","volume":"33","author":[{"given":"Flavio","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocco","family":"De Nicola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Labella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/inco.1997.2645","volume":"134","author":"Aceto","year":"1997","journal-title":"Inform. and Comput."},{"key":"R2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1996.0047","volume":"127","author":"Aceto","year":"1996","journal-title":"Inform. and Comput."},{"key":"R3","unstructured":"L. Aceto, W. Fokkink and A. Ing\u00f3lfsd\u00f3ttir, A managerie of non-finitely based process semantics over BPA*: From ready simulation to completed traces. Research Report, BRICS, RS-96-23 (1996)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0039053","volume":"458","author":"Baeten","year":"1990","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R5","unstructured":"L. Bernatsky, S.L. Bloom, Z. \u00c9sik and Gh. Stefanescu, Equational theories of relations and regular sets, inProc. of Words, Languages and Combinatorics, Kyoto, 1992. Word Scientific, (1994) 40-48."},{"key":"R6","unstructured":"S.L. Bloom and Z. \u00c9sik, Iteration Algebras of Finite State Process Behaviours. Manuscript."},{"key":"R7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1993.1001","volume":"102","author":"Bloom","year":"1993","journal-title":"Inform. and Comput."},{"key":"R8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1990240404191","volume":"24","author":"Boffa","year":"1990","journal-title":"Theoret. Informatics Appl."},{"key":"R9","unstructured":"J.H. Conway,Regular Algebra and Finite Machines. Chapman and Hall, London (1971)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"F. Corradini, R. De Nicola and A. Labella, Fully Abstract Models for Nondeterministic Regular Expressions, inProc. ofConcur'95. Springer Verlag,Lecture Notes in Comput. Sci.962(1995) 130-144.","DOI":"10.1007\/3-540-60218-6_10"},{"key":"R11","unstructured":"F. Corradini, R. De Nicola and A. Labella, Models of Nondeterministic Regular Expressions.J. Comput. System Sci., to appear."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"R. De Nicola and A. Labella, Tree Morphisms and Bisimulations, inProc. ofMFCS'98 Workshop on Concurrency. Elsevier, Amsterdam,Electron. Notes Theoret. Comput. Sci.18(1998).","DOI":"10.1016\/S1571-0661(05)80249-X"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"R. De Nicola and A. Labella, A Completeness Theorem for Nondeterministic Kleene Algebras, inProc. ofMFCS'94. Springer,Lecture Notes in Comput. Sci.841(1994) 536-545.","DOI":"10.1007\/3-540-58338-6_100"},{"key":"R14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0020-0190(94)00163-4","volume":"52","author":"Fokkink","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"W. Fokkink, On the completeness of the Equations for the Kleene Star in Bisimulation, inProc. ofAMAST'96. Springer,Lecture Notes in Comput. Sci.1101(1996) 180-194.","DOI":"10.1007\/BFb0014315"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"W. Fokkink, Axiomatizations for the perpetual loop in Process Algebras, inProc. ofICALP'97. Springer,Lecture Notes in Comput. Sci.1256(1997) 571-581.","DOI":"10.1007\/3-540-63165-8_212"},{"key":"R17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","volume":"37","author":"Fokkink","year":"1994","journal-title":"Comput. J."},{"key":"R18","unstructured":"C.A.R. Hoare,Communicating Sequential Processes. Prentice Hall (1989)."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"S.C. Kleene, Representation of Events in Nerve Nets and Finite Automata, inAutomata Studies, Shannon and McCarthy, Ed. Princeton Univ. Pr. (1956) 3-41.","DOI":"10.1515\/9781400882618-002"},{"key":"R20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-4049(92)90048-K","volume":"83","author":"Kasangian","year":"1992","journal-title":"J. Pure Appl. Algebra"},{"key":"R21","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"Kozen","year":"1994","journal-title":"Inform. and Comput."},{"key":"R22","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."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"W. Kuich and A. Salomaa,Semirings, Automata, Languages. Springer, Berlin,Monogr. Theoret. Comput. Sci. EATCS Ser.5(1986).","DOI":"10.1007\/978-3-642-69959-7_3"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"R. Milner,A Calculus of Communicating Systems. Springer-Verlag, Berlin,Lecture Notes in Comput. Sci.94(1980).","DOI":"10.1007\/3-540-10235-3"},{"key":"R25","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"R26","unstructured":"R. Milner,Communication and Concurrency. Prentice Hall (1989)."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"R.N. Moll, M.A. Arbib and A.J. Kfoury,An Introduction to Formal Language Theory. Springer-Verlag, Berlin (1987).","DOI":"10.1007\/978-1-4613-9595-9"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and Automata on Infinite sequences, inProc. GI. Springer,Lecture Notes in Comput. Sci.104(1981) 167-183.","DOI":"10.1007\/BFb0017309"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"B.C. Pierce,Basic Category Theory for Computer Scientists. The MIT Press (1991).","DOI":"10.7551\/mitpress\/1524.001.0001"},{"key":"R30","first-page":"120","volume":"16","author":"Redko","year":"1964","journal-title":"Ukrain. Mat. Z."},{"key":"R31","doi-asserted-by":"crossref","unstructured":"J. Sakarovitch, Kleene's theorem revisited, inProc. ofTrends, techniques, and problems in theoretical computer science. Springer,Lecture Notes in Comput. Sci.281(1986) 39-50.","DOI":"10.1007\/3540185356_29"},{"key":"R32","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"Salomaa","year":"1966","journal-title":"J. ACM"},{"key":"R33","doi-asserted-by":"crossref","unstructured":"P. Sewell, Bisimulation is not finitely (first order) equationally axiomatisable, inProc. ofLICS'94(1994).","DOI":"10.1109\/LICS.1994.316086"},{"key":"R34","first-page":"762","volume":"11","author":"Smith","year":"1982","journal-title":"SIAM J. Comput."},{"key":"R35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1017\/S0960129500000116","volume":"3","author":"Troeger","year":"1993","journal-title":"Math. Structures Comput. Sci."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:1999127\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T23:00:17Z","timestamp":1585263617000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:1999127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":35,"journal-issue":{"issue":"4-5"},"alternative-id":["ita9936"],"URL":"https:\/\/doi.org\/10.1051\/ita:1999127","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}