Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Crvenković, Siniša
and
Madarász, Rozália Sz.
1994.
On dynamic algebras.
Theoretical Computer Science,
Vol. 134,
Issue. 1,
p.
79.
Sewell, P.
1994.
Bisimulation is not finitely (first order) equationally axiomatisable.
p.
62.
Ésik, Z.
and
Bernátsky, L.
1995.
Equational properties of Kleene algebras of relations with conversion.
Theoretical Computer Science,
Vol. 137,
Issue. 2,
p.
237.
ésik, Zoltán
and
Bertol, Michael
1995.
Automata, Languages and Programming.
Vol. 944,
Issue. ,
p.
27.
Bloom, S. L.
�sik, Z.
and
Stefanescu, Gh.
1995.
Notes on equational theories of relations.
Algebra Universalis,
Vol. 33,
Issue. 1,
p.
98.
Bloom, Stephen L.
Sabadini, N.
and
Walters, R. F. C.
1996.
Matrices, machines and behaviors.
Applied Categorical Structures,
Vol. 4,
Issue. 4,
p.
343.
Bloom, Stephen L
and
Ésik, Zoltán
1997.
Axiomatizing Shuffle and Concatenation in Languages.
Information and Computation,
Vol. 139,
Issue. 1,
p.
62.
Kozen, Dexter
1997.
Kleene algebra with tests.
ACM Transactions on Programming Languages and Systems,
Vol. 19,
Issue. 3,
p.
427.
Sewell, Peter
1997.
Nonaxiomatisability of equivalences over finite state processes.
Annals of Pure and Applied Logic,
Vol. 90,
Issue. 1-3,
p.
163.
Aceto, Luca
and
Fokkink, Wan
1997.
An Equational Axiomatization for Multi-exit Iteration.
Information and Computation,
Vol. 137,
Issue. 2,
p.
121.
Bloom, Stephen L.
and
Ésik, Zoltán
1997.
The equational logic of fixed points.
Theoretical Computer Science,
Vol. 179,
Issue. 1-2,
p.
1.
Kozen, D.
1997.
On the complexity of reasoning in Kleene algebra.
p.
195.
Ésik, Z.
1998.
STACS 98.
Vol. 1373,
Issue. ,
p.
455.
Aceto, Luca
Fokkink, Wan
and
Ingólfsdóttir, Anna
1998.
On a question of A. Salomaa the equational theory of regular expressions over a singleton alphabet is not finitely based.
Theoretical Computer Science,
Vol. 209,
Issue. 1-2,
p.
163.
Zhang, Guo-Qiang
1999.
Automata, Boolean Matrices, and Ultimate Periodicity.
Information and Computation,
Vol. 152,
Issue. 1,
p.
138.
Crvenković, S.
Dolinka, I.
and
Ésik, Z.
2000.
The variety of Kleene algebras with conversion is not finitely based.
Theoretical Computer Science,
Vol. 230,
Issue. 1-2,
p.
235.
Bloom, Stephen L.
and
Ésik, Zoltán
2000.
LATIN 2000: Theoretical Informatics.
Vol. 1776,
Issue. ,
p.
367.
Harel, David
Kozen, Dexter
and
Tiuryn, Jerzy
2001.
Handbook of Philosophical Logic.
p.
99.
Crvenković, Siniša
Dolinka, Igor
and
Ésik, Zoltán
2001.
On Equations for Union-Free Regular Languages.
Information and Computation,
Vol. 164,
Issue. 1,
p.
152.
Bergstra, Jan A.
Fokkink, Wan
and
Ponse, Alban
2001.
Handbook of Process Algebra.
p.
333.