Finite-state automaton for regular expressions.

This package contains a full DFA/NFA implementation with Unicode alphabet and support for all standard (and a number of non-standard) regular expression operations.

The most commonly used functionality is located in the classes Automaton and RegExp.

For more information, go to the package home page at http://www.brics.dk/automaton/.