Equational properties of Kleene algebras of relations with conversion

Z. Ésik, L. Bernátsky

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

We describe a set of equational axioms for the variety generated by all algebras of binary relations with operations of union, composition, conversion and reflexive-transitive closure and neutral elements 0 (the empty relation) and 1 (the identity relation).

Original languageEnglish
Pages (from-to)237-251
Number of pages15
JournalTheoretical Computer Science
Volume137
Issue number2
DOIs
Publication statusPublished - Jan 23 1995

Fingerprint

Kleene Algebra
Algebra
Transitive Closure
Binary relation
Chemical analysis
Axioms
Union

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Equational properties of Kleene algebras of relations with conversion. / Ésik, Z.; Bernátsky, L.

In: Theoretical Computer Science, Vol. 137, No. 2, 23.01.1995, p. 237-251.

Research output: Contribution to journalArticle

@article{4dabe370ad8e41feb2550698b5a28876,
title = "Equational properties of Kleene algebras of relations with conversion",
abstract = "We describe a set of equational axioms for the variety generated by all algebras of binary relations with operations of union, composition, conversion and reflexive-transitive closure and neutral elements 0 (the empty relation) and 1 (the identity relation).",
author = "Z. {\'E}sik and L. Bern{\'a}tsky",
year = "1995",
month = "1",
day = "23",
doi = "10.1016/0304-3975(94)00041-G",
language = "English",
volume = "137",
pages = "237--251",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Equational properties of Kleene algebras of relations with conversion

AU - Ésik, Z.

AU - Bernátsky, L.

PY - 1995/1/23

Y1 - 1995/1/23

N2 - We describe a set of equational axioms for the variety generated by all algebras of binary relations with operations of union, composition, conversion and reflexive-transitive closure and neutral elements 0 (the empty relation) and 1 (the identity relation).

AB - We describe a set of equational axioms for the variety generated by all algebras of binary relations with operations of union, composition, conversion and reflexive-transitive closure and neutral elements 0 (the empty relation) and 1 (the identity relation).

UR - http://www.scopus.com/inward/record.url?scp=0029183712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029183712&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(94)00041-G

DO - 10.1016/0304-3975(94)00041-G

M3 - Article

AN - SCOPUS:0029183712

VL - 137

SP - 237

EP - 251

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -