Search

• < Previous
• 1
• Next >

Non-Deterministic Kleene Coalgebras

In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic finite automata) and&nbsp;[&hellip;]