External Resources:

Similar packages:

Finite-State Automaton for Regular Expressions

Automaton is a DFA/NFA (finite-state automata) implementation with Unicode
alphabet (UTF16) and support for the standard regular expression operations
(concatenation, union, Kleene star) and a number of non-standard ones
(intersection, complement, etc.).