A characterization of regular expressions under bisimulation

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

• Type: Journal
• Year: 2007
• Where: JACM
• Authors: Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer
• Keywords: JACM 2007, Modulo Bisimulation Equivalence, Open Question, Well-behaved finite Automata