Title :
Regular expressions in process algebra
Author :
Baeten, J.C.M. ; Corradini, F.
Author_Institution :
Dept. of Comput. Sci., Technische Univ. Eindhoven, Netherlands
Abstract :
We tackle 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.
Keywords :
bisimulation equivalence; finite automata; formal languages; process algebra; set theory; finite automata; modulo bisimulation equivalence; process algebra; regular expression; set theory; Algebra; Automata; Carbon capture and storage; Computer science; Formal languages; Logic; Mathematics; System recovery;
Conference_Titel :
Logic in Computer Science, 2005. LICS 2005. Proceedings. 20th Annual IEEE Symposium on
Print_ISBN :
0-7695-2266-1
DOI :
10.1109/LICS.2005.43
