Reduction rule for Kleene's Closure in replacement of Thompson's algorithm

[Erik Poupaert]

Hi 

I guess there must be people watching this list, interested in this.

I hope I now finally found the way I was looking for, to formulate a
reduction rule for Kleene's Closure which can be used in replacement
of Thompson's algorithm, or so I hope. I could be wrong about it,
however.

http://erik-poupaert.com/12001.html

If anybody feels like veryfying the reduction rule and the resulting
algorithm used to derive a regex DFA directly, feel free to let me
know what your results are.

The reduction rule is:

T{a(xy)*b} = T{ab} + T {axyb} + T{axyxyb} 

With T{e} the collection of transitions derived from any regex e.

By applying the rule recursively, one obtains all DFA transitions for
any regex, or so I hope it is true. In such case, if proven to be
true, it is truly a replacement for Thompson's algorithm.

Greetings
Erik Poupaert