- A builder for constructing a deterministic finite automaton from regular expressions.
- A dense DFA that shrinks its alphabet.
- A dense DFA that premultiplies all of its state identifiers in its transition table.
- The default configuration of a dense DFA, which uses byte classes and premultiplies its state identifiers.
- A standard dense DFA that does not use premultiplication or byte classes.
- A dense table-based deterministic finite automaton (DFA).