Expressiveness modulo bisimilarity of regular expressions with parallel composition
(2015)
Journal Article
Luttik, B. A., Baeten, J. C., Muller, T. I., & Van Tilburg, P. (2015). Expressiveness modulo bisimilarity of regular expressions with parallel composition. Mathematical Structures in Computer Science, 26(6), 933-968. https://doi.org/10.1017/S0960129514000309
© Cambridge University Press 2015. The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimil... Read More about Expressiveness modulo bisimilarity of regular expressions with parallel composition.