Finite-state automaton with regular expression operations. <p> Class invariants: <ul> <li> An automaton is either represented explicitly (with {@link

A tool that performs match operations on a given character sequence using a compiled automaton. @author John Gibson &lt;<a href="mailto:jgibson@mitre

Automaton provider for <code>RegExp.</code>{@link RegExp#toAutomaton(AutomatonProvider)}

Construction of basic automata.

Basic automata operations.

Basic automata for representing common datatypes related to Unicode, XML, and XML Schema.

Automaton provider based on {@link Datatypes}.

Supports an optimised version of substring matching an automaton against an input string in linear time with no backtracking. <p>In essence we simply

Tests {@link MatchOnlyRunAutomaton}.

Operations for minimizing automata.

Regular Expression extension to <code>Automaton</code>. <p> Regular expressions are built from the following abstract syntax: <table border="0"> <tr><

Finite-state automaton with fast run operation. @author Anders M&oslash;ller &lt;<a href="mailto:amoeller@cs.au.dk">amoeller@cs.au.dk</a>&gt;

Tests {@link RunAutomaton}

Automata operations involving shuffling.

Special automata operations.

State with <code>char</code> labels on transitions.

<code>Automaton</code> state. @author Anders M&oslash;ller &lt;<a href="mailto:amoeller@cs.au.dk">amoeller@cs.au.dk</a>&gt;

Pair of states. @author Anders M&oslash;ller &lt;<a href="mailto:amoeller@cs.au.dk">amoeller@cs.au.dk</a>&gt;

Operations for building minimal deterministic automata from sets of strings. The algorithm requires sorted input data, but is very fast (nearly linear

<code>Automaton</code> transition. <p> A transition, which belongs to a source state, consists of a Unicode character interval and a destination state