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
| Author: | Thorsten EhmGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-252 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/38 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2003-13) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2003 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2005/01/25 |
| Tag: | Kleene algebra; pointer algebra; pointer structures |
| GND-Keyword: | Kleene-Algebra; Zeiger <Informatik> |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
