Inherits fst::FstImpl< A >.
List of all members.
class fst::ComplementFstImpl< A >
Implementation of delayed ComplementFst. The algorithm used completes the (deterministic) FSA and then exchanges final and non-final states. Completion, i.e. ensuring that all labels can be read from every state, is accomplished by using RHO labels, which match all labels that are otherwise not found leaving a state. The first state in the output is reserved to be a new state that is the destination of all RHO labels. Each remaining output state s corresponds to input state s - 1. The first arc in the output at these states is the rho label, the remaining arcs correspond to the input arcs.
Definition at line 48 of file complement.h.
Member Typedef Documentation
Constructor & Destructor Documentation
Member Function Documentation
Exchange final and non-final states; make rho destination state final.
Definition at line 93 of file complement.h.
Friends And Related Function Documentation
The documentation for this class was generated from the following file: