The variety of Kleene algebras with conversion is not finitely based
- 1 January 2000
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 230 (1-2) , 235-245
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Group Axioms for IterationInformation and Computation, 1999
- The equational logic of fixed pointsTheoretical Computer Science, 1997
- Notes on equational theories of relationsAlgebra universalis, 1995
- Equational properties of Kleene algebras of relations with conversionTheoretical Computer Science, 1995
- Nonfinite axiomatizability of the equational theory of shuffleLecture Notes in Computer Science, 1995
- Equational axioms for regular setsMathematical Structures in Computer Science, 1993
- On Kleen algebrasTheoretical Computer Science, 1993
- Complete systems ofB-rational identitiesTheoretical Computer Science, 1991
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966