Various inequivalent definitions of [|Kleene algebras] and related structures have been given in the literature. Here we will give the definition that seems to be the most common nowadays. A Kleene algebra is a setA together with two binary operations + : A × A → A and · : A × A → A and one function * : A → A, written as a + b, ab and a* respectively, so that the following axioms are satisfied.
Associativity of + and ·: a + = + c and a = c for all a, b, c in A.
Distributivity: a = + and a = + for all a, b, c in A
Identity elements for + and ·: There exists an element 0 in A such that for all a in A: a + 0 = 0 + a = a. There exists an element 1 in A such that for all a in A: a1 = 1a = a.
The [|above] axioms define a semiring. We further require:
+ is idempotent: a + a = a for all a in A.
It is now possible to define a partial order ≤ on A by setting a ≤ b if and only if a + b = b. With this order we can formulate the last four axioms about the operation *:
1 + a ≤ a* for all a in A.
1 + a ≤ a* for all a in A.
if a and x are in A such that ax ≤ x, then a*x ≤ x
if a and x are in A such that xa ≤ x, then x ≤ x
Intuitively, one should think of a + b as the "union" or the "least upper bound" of a and b and of ab as some multiplication which is monotonic, in the sense that a ≤ b implies ax ≤ bx. The idea behind the star operator is a* = 1 + a + aa + aaa +... From the standpoint of programming language theory, one may also interpret + as "choice", · as "sequencing" and * as "iteration".
Examples
Kleene algebras and
+
·
*
0
1
Regular expressions
not written
*
∅
ε
Let Σ be a finite set and let A be the set of all regular expressions over Σ. We consider two such regular expressions equal if they describe the same language. Then A forms a Kleene algebra. In fact, this is a free Kleene algebra in the sense that any equation among regular expressions follows from the Kleene algebra axioms and is therefore valid in every Kleene algebra. Again let Σ be an alphabet. Let A be the set of all regular languages over Σ. Then the union and the concatenation of two elements of A again belong to A, and so does the Kleene star operation applied to any element ofA. We obtain a Kleene algebra A with 0 being the empty set and 1 being the set that only contains the empty string. Let M be a monoid with identity element e and let A be the set of all subsets of M. For two such subsets S and T, let S + T be the union of S and T and set ST =. S* is defined as the submonoid of M generated by S, which can be described as ∪ S ∪ SS ∪ SSS ∪... Then A forms a Kleene algebra with 0 being the empty set and 1 being. An analogous construction can be performed for any small category. The linear subspaces of a unital algebra over a field form a Kleene algebra. Given linear subspaces V and W, define V + W to be the sum of the two subspaces, and 0 to be the trivial subspace. Define V · W = span, the linear span of the product of vectors from V and W respectively. Define 1 = span, the span of the unit of the algebra. The closure of V is the direct sum of all powers of V. Suppose M is a set and A is the set of all binary relations on M. Taking + to be the union, · to be the composition and * to be the reflexive transitive closure, we obtain a Kleene algebra. Every Boolean algebra with operations and turns into a Kleene algebra if we use for +, for · and set a* = 1 for all a. A quite different Kleene algebra can be used to implement the Floyd–Warshall algorithm, computing the shortest path's length for every two vertices of a weighted directed graph, by Kleene's algorithm, computing a regular expression for every two states of a deterministic finite automaton. Using the extended real number line, take a + b to be the minimum of a and b and ab to be the ordinary sum of a and b. a* is defined to be the real number zero for nonnegative a and −∞ for negative a. This is a Kleene algebra with zero element +∞ and one element the real number zero. A weighted directed graph can then be considered as a deterministic finite automaton, with each transition labelled by its weight. For any two graph nodes, the regular expressions computed from Kleene's algorithm evaluates, in this particular Kleene algebra, to the shortest path length between the nodes.
Properties
Zero is the smallest element: 0 ≤ a for all a in A. The sum a + b is the least upper bound of a and b: we have a ≤ a + b and b ≤ a + b and if x is an element of A with a ≤ x and b ≤ x, then a + b ≤ x. Similarly, a1 +... + an is the least upper bound of the elementsa1,..., an. Multiplication and addition are monotonic: if a ≤ b, then
a + x ≤ b + x,
ax ≤ bx, and
xa ≤ xb
for all x in A. Regarding the star operation, we have
0* = 1 and 1* = 1,
a ≤ b implies a* ≤ b*,
an ≤ a* for every natural number n, where an is defined as n-fold multiplication of a,
= a*,
* = a*,
1 + a = a* = 1 + a,
ax = xb implies x = x,
a = a,
* = a**, and
pq = 1 = qp implies qp = *.
If A is a Kleene algebra and n is a natural number, then one can consider the set Mn consisting of all n-by-nmatrices with entries in A. Using the ordinary notions of matrix addition and multiplication, one can define a unique *-operation so that Mn becomes a Kleene algebra.
History
Kleene introduced regular expressions and gave some of their algebraic laws. Although he didn't define Kleene algebras, he asked for a decision procedure for equivalence of regular expressions. Redko proved that no finite set of equational axioms can characterize the algebra of regular languages. Salomaa gave complete axiomatizations of this algebra, however depending on problematic inference rules. The problem of providing a complete set of axioms, which would allow derivation of all equations among regular expressions, was intensively studied by John Horton Conway under the name of regular algebras, however, the bulk of his treatment was infinitary. In 1981, Kozen gave a complete infinitary equational deductive system for the algebra of regular languages. In 1994, he gave the above finite axiom system, which uses unconditional and conditional equalities, and is equationally complete for the algebra of regular languages, that is, two regular expressions a and b denote the same language only if a=b follows from the above axioms.
Generalization (or relation to other structures)
Kleene algebras are a particular case of closed semirings, also called quasi-regular semirings or Lehmann semirings, which are semirings in which every element has at least one quasi-inverse satisfying the equation: a* = aa* + 1 = a*a + 1. This quasi-inverse is not necessarily unique. In a Kleene algebra, a* is the least solution to the fixpoint equations: X = aX + 1 and X = Xa + 1. Closed semirings and Kleene algebras appear in algebraic path problems, a generalization of the shortest path problem.
