Une condition impliquant toutes les identités rationnelles
RAIRO-Theor. Inf. Appl., 29 6 (1995) 515-518
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
15980 453 (2026)
https://doi.org/10.1007/978-3-032-06085-3_24
Left-handed completeness
Dexter Kozen and Alexandra SilvaTheoretical Computer Science 807 220 (2020)
https://doi.org/10.1016/j.tcs.2019.10.040
Equational properties of fixed-point operations in cartesian categories: An overview
Z ÉsikMathematical Structures in Computer Science 29 (06) 909 (2019)
https://doi.org/10.1017/S0960129518000361
Algorithms for Kleene algebra with converse
Paul Brunet and Damien PousJournal of Logical and Algebraic Methods in Programming 85 (4) 574 (2016)
https://doi.org/10.1016/j.jlamp.2015.07.005
Proving language inclusion and equivalence by coinduction
Jurriaan Rot, Marcello Bonsangue and Jan RuttenInformation and Computation 246 62 (2016)
https://doi.org/10.1016/j.ic.2015.11.009
On the Fine-Structure of Regular Algebra
Simon Foster and Georg StruthJournal of Automated Reasoning 54 (2) 165 (2015)
https://doi.org/10.1007/s10817-014-9318-9
Completeness results for omega-regular algebras
James Cranch, Michael R. Laurence and Georg StruthJournal of Logical and Algebraic Methods in Programming 84 (3) 402 (2015)
https://doi.org/10.1016/j.jlamp.2014.10.002
Relational and Algebraic Methods in Computer Science
Paul Brunet and Damien PousLecture Notes in Computer Science, Relational and Algebraic Methods in Computer Science 8428 101 (2014)
https://doi.org/10.1007/978-3-319-06251-8_7
Relational and Algebraic Methods in Computer Science
Michael R. Laurence and Georg StruthLecture Notes in Computer Science, Relational and Algebraic Methods in Computer Science 7560 179 (2012)
https://doi.org/10.1007/978-3-642-33314-9_12
Relational and Algebraic Methods in Computer Science
Dexter Kozen and Alexandra SilvaLecture Notes in Computer Science, Relational and Algebraic Methods in Computer Science 7560 162 (2012)
https://doi.org/10.1007/978-3-642-33314-9_11
Automated Reasoning
Simon Foster and Georg StruthLecture Notes in Computer Science, Automated Reasoning 7364 271 (2012)
https://doi.org/10.1007/978-3-642-31365-3_22
Left omega algebras and regular equations
Georg StruthThe Journal of Logic and Algebraic Programming 81 (6) 705 (2012)
https://doi.org/10.1016/j.jlap.2012.05.004
Relational and Algebraic Methods in Computer Science
Alasdair Armstrong and Georg StruthLecture Notes in Computer Science, Relational and Algebraic Methods in Computer Science 7560 66 (2012)
https://doi.org/10.1007/978-3-642-33314-9_5
Completeness for flat modal fixpoint logics
Luigi Santocanale and Yde VenemaAnnals of Pure and Applied Logic 162 (1) 55 (2010)
https://doi.org/10.1016/j.apal.2010.07.003
Axiomatizing the equational theory of regular tree languages
Z. ÉsikThe Journal of Logic and Algebraic Programming 79 (2) 189 (2010)
https://doi.org/10.1016/j.jlap.2009.10.001
29 (2009)
https://doi.org/10.1007/978-3-642-01492-5_2
Axiomatizing rational power series over natural numbers
S.L. Bloom and Z. ÉsikInformation and Computation 207 (7) 793 (2009)
https://doi.org/10.1016/j.ic.2009.02.003
Developments in Language Theory
Zoltán ÉsikLecture Notes in Computer Science, Developments in Language Theory 5257 1 (2008)
https://doi.org/10.1007/978-3-540-85780-8_1
Algebraically complete semirings and Greibach normal form
Zoltán Ésik and Hans LeißAnnals of Pure and Applied Logic 133 (1-3) 173 (2005)
https://doi.org/10.1016/j.apal.2004.10.008
On the equational definition of the least prefixed point
Luigi SantocanaleTheoretical Computer Science 295 (1-3) 341 (2003)
https://doi.org/10.1016/S0304-3975(02)00412-7
Substructural logic and partial correctness
Dexter Kozen and Jerzy TiurynACM Transactions on Computational Logic 4 (3) 355 (2003)
https://doi.org/10.1145/772062.772066
Computer Science Logic
Zoltán Ésik and Hans LeiβLecture Notes in Computer Science, Computer Science Logic 2471 135 (2002)
https://doi.org/10.1007/3-540-45793-3_10
Shuffle binoids
S. L. Bloom and Z. ÉsikRAIRO - Theoretical Informatics and Applications 32 (4-6) 175 (1998)
https://doi.org/10.1051/ita/1998324-601751
The equational logic of fixed points
Stephen L. Bloom and Zoltán ÉsikTheoretical Computer Science 179 (1-2) 1 (1997)
https://doi.org/10.1016/S0304-3975(96)00248-4