Kleene algebras and pointer structures
- Kleene algebras (KA) have turned out to be an appropriate tool to formally describe algebraic systems in various areas. Despite this universal applicability there often proofs are easy and half as long as in concrete KAs. In this paper we describe how to use KAs to model edge-labeled directed graphs. As an application we show how the relational pointer algebra developed by B. Möller can be treated with this technique.
Download full text files
Statistics
Additional Services
