Lines Matching full:states
9 // states that represent a nondeterministic finite state automaton (NFA) and
37 /// a function of the cardinality of the set of states.
63 /// The state type of deterministic states. These are only used internally to
68 /// NFA states.
71 /// A DFA transition consists of a set of NFA states transitioning to a
72 /// new set of NFA states. The DfaTransitionInfo tracks, for every
73 /// transitioned-from NFA state, a set of valid transitioned-to states.
84 /// transition to multiple target states.
90 /// The set of deterministic states. DfaStates.getId(DfaState) returns an ID,
100 /// Visit all NFA states and construct the DFA.
103 /// states.