Non-Deterministic Kleene Coalgebras

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-610545

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.