Une remarque sur les systèmes complets d'identités rationnelles
RAIRO-Theor. Inf. Appl., 24 4 (1990) 419-423
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):
13896 158 (2023)
https://doi.org/10.1007/978-3-031-28083-2_10
Relational and Algebraic Methods in Computer Science
Damien Pous, Jurriaan Rot and Jana WagemakerLecture Notes in Computer Science, Relational and Algebraic Methods in Computer Science 13027 378 (2021)
https://doi.org/10.1007/978-3-030-88701-8_23
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
11425 207 (2019)
https://doi.org/10.1007/978-3-030-17127-8_12
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
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
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
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
Free inductive K -semialgebras
Z. Ésik and W. KuichThe Journal of Logic and Algebraic Programming 82 (3-4) 111 (2013)
https://doi.org/10.1016/j.jlap.2013.01.001
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
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
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
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
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
Géraud SénizerguesSIAM Journal on Computing 34 (5) 1025 (2005)
https://doi.org/10.1137/S0097539700377256
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
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
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
A Finite Axiomatization of Nondeterministic Regular Expressions
Flavio Corradini, Rocco De Nicola and Anna LabellaRAIRO - Theoretical Informatics and Applications 33 (4-5) 447 (1999)
https://doi.org/10.1051/ita:1999127
Models of Nondeterministic Regular Expressions
Flavio Corradini, Rocco De Nicola and Anna LabellaJournal of Computer and System Sciences 59 (3) 412 (1999)
https://doi.org/10.1006/jcss.1999.1636
STACS 98
Z. ÉsikLecture Notes in Computer Science, STACS 98 1373 455 (1998)
https://doi.org/10.1007/BFb0028581
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
Completeness of Park induction
Z. ÉsikTheoretical Computer Science 177 (1) 217 (1997)
https://doi.org/10.1016/S0304-3975(96)00240-X
Nonaxiomatisability of equivalences over finite state processes
Peter SewellAnnals of Pure and Applied Logic 90 (1-3) 163 (1997)
https://doi.org/10.1016/S0168-0072(97)00036-5
Tools and Algorithms for the Construction and Analysis of Systems
Dexter KozenLecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems 1055 14 (1996)
https://doi.org/10.1007/3-540-61042-1_35
Equational properties of Kleene algebras of relations with conversion
Z. Ésik and L. BernátskyTheoretical Computer Science 137 (2) 237 (1995)
https://doi.org/10.1016/0304-3975(94)00041-G
Une condition impliquant toutes les identités rationnelles
M. BoffaRAIRO - Theoretical Informatics and Applications 29 (6) 515 (1995)
https://doi.org/10.1051/ita/1995290605151
Rewriting extended regular expressions
Valentin M. Antimirov and Peter D. MossesTheoretical Computer Science 143 (1) 51 (1995)
https://doi.org/10.1016/0304-3975(95)80024-4
Automata, Languages and Programming
Zoltán ésik and Michael BertolLecture Notes in Computer Science, Automata, Languages and Programming 944 27 (1995)
https://doi.org/10.1007/3-540-60084-1_60
62 (1994)
https://doi.org/10.1109/LICS.1994.316086
Complete systems ofB-rational identities
Daniel KrobTheoretical Computer Science 89 (2) 207 (1991)
https://doi.org/10.1016/0304-3975(91)90395-I