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:

Une remarque sur les systèmes complets d'identités rationnelles

Maurice Boffa

RAIRO-Theor. Inf. Appl., 24 4 (1990) 419-423

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1990240404191

This article has been cited by the following article(s):

The equational logic of fixed points

Stephen L. Bloom and Zoltán Ésik
Theoretical Computer Science 179 (1-2) 1 (1997)
DOI: 10.1016/S0304-3975(96)00248-4
See this article

Relational and Algebraic Methods in Computer Science

Michael R. Laurence and Georg Struth
Lecture Notes in Computer Science, Relational and Algebraic Methods in Computer Science 7560 179 (2012)
DOI: 10.1007/978-3-642-33314-9_12
See this article

Equational properties of Kleene algebras of relations with conversion

Z. Ésik and L. Bernátsky
Theoretical Computer Science 137 (2) 237 (1995)
DOI: 10.1016/0304-3975(94)00041-G
See this article

Complete systems ofB-rational identities

Daniel Krob
Theoretical Computer Science 89 (2) 207 (1991)
DOI: 10.1016/0304-3975(91)90395-I
See this article

On the equational definition of the least prefixed point

Luigi Santocanale
Theoretical Computer Science 295 (1-3) 341 (2003)
DOI: 10.1016/S0304-3975(02)00412-7
See this article

Algebraically complete semirings and Greibach normal form

Zoltán Ésik and Hans Leiß
Annals of Pure and Applied Logic 133 (1-3) 173 (2005)
DOI: 10.1016/j.apal.2004.10.008
See this article

Relational and Algebraic Methods in Computer Science

Alasdair Armstrong and Georg Struth
Lecture Notes in Computer Science, Relational and Algebraic Methods in Computer Science 7560 66 (2012)
DOI: 10.1007/978-3-642-33314-9_5
See this article

Models of Nondeterministic Regular Expressions

Flavio Corradini, Rocco De Nicola and Anna Labella
Journal of Computer and System Sciences 59 (3) 412 (1999)
DOI: 10.1006/jcss.1999.1636
See this article

Nonaxiomatisability of equivalences over finite state processes

Peter Sewell
Annals of Pure and Applied Logic 90 (1-3) 163 (1997)
DOI: 10.1016/S0168-0072(97)00036-5
See this article

Rewriting extended regular expressions

Valentin M. Antimirov and Peter D. Mosses
Theoretical Computer Science 143 (1) 51 (1995)
DOI: 10.1016/0304-3975(95)80024-4
See this article

Algorithms for Kleene algebra with converse

Paul Brunet and Damien Pous
Journal of Logical and Algebraic Methods in Programming 85 (4) 574 (2016)
DOI: 10.1016/j.jlamp.2015.07.005
See this article

Axiomatizing rational power series over natural numbers

S.L. Bloom and Z. Ésik
Information and Computation 207 (7) 793 (2009)
DOI: 10.1016/j.ic.2009.02.003
See this article

The Bisimulation Problem for Equational Graphs of Finite Out-Degree

Géraud Sénizergues
SIAM Journal on Computing 34 (5) 1025 (2005)
DOI: 10.1137/S0097539700377256
See this article

Completeness of Park induction

Z. Ésik
Theoretical Computer Science 177 (1) 217 (1997)
DOI: 10.1016/S0304-3975(96)00240-X
See this article

Free inductive K -semialgebras

Z. Ésik and W. Kuich
The Journal of Logic and Algebraic Programming 82 (3-4) 111 (2013)
DOI: 10.1016/j.jlap.2013.01.001
See this article

Axiomatizing the equational theory of regular tree languages

Z. Ésik
The Journal of Logic and Algebraic Programming 79 (2) 189 (2010)
DOI: 10.1016/j.jlap.2009.10.001
See this article