The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
| Hi-index | 0.00 |
This paper proves a conjecture of Meyer and Stockmeyer, that the equivalence problem of regular expressions over one letter alphabets, with the operations of union, concatenation, Kleene star, negation and squaring, is solvable in elementary time and space. This is done by reduction of this problem to Presburger Arithmetic, making use of an algorithm presented by Oppen.