Lines Matching full:states
47 // disjoint, we map Arc::StateId on the type MappedId. The states of
51 // the correct treatment of non-coaccessible states; kNoStateId is
117 // states that can be reached by the same prefixes, starting with a
118 // set containing the start states of both acceptors. A disjoint tree
120 // states. The algorithm returns 'false' if one of the constructed
121 // sets contains both final and non-final states. Returns optional error
125 // n = |S1| + |S2| is the number of states in both acceptors
191 // representing destination states of the corresponding arcs in fst1
203 // Early return if the start states differ w.r.t. being final.
210 // invariant: each block of states contains either final states only
211 // or non-final states only.
249 // states.
