dk.brics.automaton is a DFA/NFA implementation
with Unicode alphabet and support for all standard
regular expression operations: concatenation,
union, intersection, complement, Kleene star, etc.
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.
This release added Daciuk et al.'s algorithm for constructing a minimal automaton that accepts a union of strings. Minimization is now optional when constructing automata from regexps. The Reverse operation was made public.
