1. A system for matching input symbols from an input stream against character classes (CCLs) in a nondeterministic finite automata (NFA) cell array, comprising: the NFA cell array; a CCL comparator enabled to accept symbols from the input stream; and a spin sequence monitor and counter enabled to accept signals from the CCL comparator; wherein: the NFA cell array is configured with a predetermined set of information, the CCL comparator performs, on the symbols from the input stream, CCL comparisons for a spinner and a base sequence of a complex state to match a predetermined pattern in the input stream; the spin sequence monitor and counter monitors spinner comparisons, maintains a spin count for comparison to a minimum spin count and maximum spin count, and receives an in-transition signal which enables spin count; and the NFA cell array is configured to provide an output signal indicative of a match to the predetermined pattern in the input stream.