Abstract

Abstract. We investigate conditions under which a given Kleene algebra with tests is isomorphic to an algebra of binary relations. Two simple separation properties are identified that, along with star-continuity, are sufficient for nonstandard relational representation. An algebraic condition is identified that is necessary and sufficient for the construction to produce a standard representation. 1

Citations

3377	Introduction to Automata Theory, Languages, and Computation - Hopcroft, Motwani, et al. - 2003
2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
318	Representation of events in nerve nets and finite automata - Kleene - 1956
312	Propositional dynamic logic of regular programs - Fischer, Ladner - 1979
233	Regular Algebra and Finite Machines - Conway - 1971
20	On induction vs. *-continuity - Kozen - 1981
16	A semiring on convex polygons and zerosum cycle problems - Iwano, Steiglitz - 1990
1	algebra with tests and commutativity conditions - Kleene