Computer Science – Logic in Computer Science
Scientific paper
2010-07-21
LMCS 6 (3:23) 2010
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-6(3:23)2010
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 Milner (on regular behaviours and finite labelled transition systems), and includes many other systems such as Mealy and Moore machines.
Bonsangue Marcello
Rutten Jan
Silva Alexandra
No associations
LandOfFree
Non-Deterministic Kleene Coalgebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Non-Deterministic Kleene Coalgebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-Deterministic Kleene Coalgebras will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-610545