#include <fst/minimize.h>

Classes | |
| class | ArcIterCompare |
Public Types | |
| typedef A::Label | Label |
| typedef A::StateId | StateId |
| typedef A::StateId | ClassId |
| typedef A::Weight | Weight |
| typedef ReverseArc< A > | RevA |
Public Member Functions | |
| CyclicMinimizer (const ExpandedFst< A > &fst) | |
| ~CyclicMinimizer () | |
| const Partition< StateId > & | partition () const |
Computes equivalence classes for cyclic Fsts. For cyclic minimization we use the classic HopCroft minimization algorithm, which is of
O(E)log(N),
where E is the number of edges in the machine and N is number of states.
The following paper describes the original algorithm An N Log N algorithm for minimizing states in a finite automaton by John HopCroft, January 1971
Definition at line 128 of file minimize.h.
| typedef A::StateId fst::CyclicMinimizer< A, Queue >::ClassId |
Definition at line 132 of file minimize.h.
| typedef A::Label fst::CyclicMinimizer< A, Queue >::Label |
Definition at line 130 of file minimize.h.
| typedef ReverseArc<A> fst::CyclicMinimizer< A, Queue >::RevA |
Definition at line 134 of file minimize.h.
| typedef A::StateId fst::CyclicMinimizer< A, Queue >::StateId |
Definition at line 131 of file minimize.h.
| typedef A::Weight fst::CyclicMinimizer< A, Queue >::Weight |
Definition at line 133 of file minimize.h.
| fst::CyclicMinimizer< A, Queue >::CyclicMinimizer | ( | const ExpandedFst< A > & | fst | ) | [inline] |
Definition at line 136 of file minimize.h.
| fst::CyclicMinimizer< A, Queue >::~CyclicMinimizer | ( | ) | [inline] |
Definition at line 141 of file minimize.h.
| const Partition<StateId>& fst::CyclicMinimizer< A, Queue >::partition | ( | ) | const [inline] |
Definition at line 145 of file minimize.h.
1.7.1