This talk is devoted to present a technique to simplify regular expressions. Several ideas of Computer Algebra and symbolic computing are applied to the regular expression symbolic domain. An implementation of the described technique has been developed.
The talk is divided in the following sections:
In section 1, the problem is stated. We present a wide view of the
question proposed for solution.
In section 2, the technique for simplifying
is outlined. In section 3, the method of representation and manipulation of
expressions is explained. Finally, in section 4, the implemented regular
expression simplifier system is presented, together with examples of
its usage.
