Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

JACM
2007

favoriteEmaildiscussreport

90views more JACM 2007»

A characterization of regular expressions under bisimulation

13 years 6 months ago

A characterization of regular expressions under bisimulation

Download www.phil.uu.nl

We solve an open question of Milner [1984]. We deﬁne a set of so-called well-behaved ﬁnite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions, and we show how to determine whether a given ﬁnite automaton is in this set. As an application, we consider the star height problem.

Jos C. M. Baeten, Flavio Corradini, Clemens Grabma

Real-time Traffic

JACM 2007 | Modulo Bisimulation Equivalence | Open Question | Well-behaved ﬁnite Automata |

claim paper

Related Content

» Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations

» An Algebra for Kripke Polynomial Coalgebras

» Query containment and rewriting using views for regular path queries under constraints

» On the Expressiveness and Complexity of ATL

» A workload for evaluating deep packet inspection architectures

» A Class of LDPC Erasure Distributions with ClosedForm Threshold Expression

» The expressive power of the shuffle product

» On firstorder topological queries

» Logic Meets Algebra the Case of Regular Languages

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JACM
Authors	Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer

Comments (0)