Lines Matching full:states
50 // - states
122 // where E is the number of edges in the machine and N is number of states.
125 // An N Log N algorithm for minimizing states in a finite automaton
212 // - loop over states in fst and split on final, creating two blocks
287 // Partioning of states into equivalence classes
296 // Priority queue of open arc iterators for all states in the 'splitter'
391 // cluster states according to height (distance to final state)
405 // refine states based on arc sort (out degree, arc equivalence)
415 // sort states within equivalence class
448 // Given a partition and a mutable fst, merge states of Fst inplace
451 // Each arc is then reconnected to this state. All states in the class
464 // relabel destination states
495 // connect fst before minimization, handles disconnected states
