## Paper: Regular Expressions in Process Algebra (at LICS 2005)

Authors:**J.C.M. Baeten F. Corradini**

### Abstract

We tackle an open question of Milner ([10]). We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions.

### BibTeX

@InProceedings{BaetenCorradini-RegularExpressionsi, author = {J.C.M. Baeten and F. Corradini}, title = {Regular Expressions in Process Algebra}, booktitle = {Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2005}, year = 2005, editor = {Prakash Panangaden}, month = {June}, pages = {12--19}, location = {Chicago, USA}, publisher = {IEEE Computer Society Press} }