Line: 1 to 1  

Minimize  
Line: 68 to 68  
 
Deleted:  
< <   CyrilAllauzen  27 Feb 2009  

Line: 1 to 1  

Minimize  
Line: 15 to 15  
template<class Arc>  
Changed:  
< <  void Minimize(MutableFst  
> >  void Minimize(MutableFst  
 %DOX{namespacefst.html#Minimize[]}% 
fstminimize in.fst [out1.fst [out2.fst]] 
Line: 1 to 1  

Minimize  
Line: 36 to 36  
Transducer minimization  
Deleted:  
< <  TBA  
 
Line: 46 to 44  
fstminimize a.fst b.fst  
Deleted:  
< <  TBA  
 
Line: 78 to 74  
 
Added:  
> > 

Line: 1 to 1  

Minimize  
Line: 39 to 39  
TBA
 
Changed:  
< < 
 
> > 
 
Minimize(A, &B);  
Line: 49 to 49  
TBA
 
Changed:  
< < 
 
> > 
 
Minimize(A, &B, &C);  
Line: 76 to 76  
 
Added:  
> > 

Line: 1 to 1  

Minimize  
Line: 25 to 25  
Acceptor minimization  
Changed:  
< <   
> > 
 
Changed:  
< <  
> >  Minimize(A, &B); fstminimize a.fst b.fst  
Deleted:  
< <   
Changed:  
< <  
> >  Transducer minimization  
Added:  
> >  TBA  
 
Changed:  
< < 
 
> > 
 
Minimize(A, &B);  
Line: 43 to 46  
fstminimize a.fst b.fst  
Added:  
> >  TBA  
Changed:  
< <  Transducer minimization  
> > 
Minimize(A, &B, &C); fstminimize a.fst b.fst c.fst  
Deleted:  
< <  TBA  
Complexity 
Line: 1 to 1  

Minimize  
Line: 9 to 9  
If the input FST A is an automaton (acceptor), this operation produces the minimal automaton B equivalent to A , i.e. the automata with a minimal number of states
that is equivalent to A .  
Changed:  
< <  If the input FST A is a transducer, this operation internally builds an equivalent transducer with a minimal number of states. However, this minimality is obtained by allowing transition having strings of symbols as output labels. Such transducers are not directly supported by the library. By defaut, Minimize will convert such transducer by expanding each stringlabeled transition into a sequence of transitions. This will results in the creation of new states, hence losing the minimality property. If a second output argument is given to Minimize , then the first output B will be the minimal transducer with each strings that is the output label of a transition being mapped to a new output symbol, the second output transducer C represents the mapping between new output labels and old output labels. Hence, we will have that A is equivalent to B o C .  
> >  If the input FST A is a transducer, this operation internally builds an equivalent transducer with a minimal number of states. However, this minimality is obtained by allowing transition having strings of symbols as output labels, this known in the litterature as a realtime transducer. Such transducers are not directly supported by the library. By defaut, Minimize will convert such transducer by expanding each stringlabeled transition into a sequence of transitions. This will results in the creation of new states, hence losing the minimality property. If a second output argument is given to Minimize , then the first output B will be the minimal realtime transducer with each strings that is the output label of a transition being mapped to a new output symbol, the second output transducer C represents the mapping between new output labels and old output labels. Hence, we will have that A is equivalent to B o C .  
Usage 
Line: 1 to 1  

Minimize  
Line: 9 to 9  
If the input FST A is an automaton (acceptor), this operation produces the minimal automaton B equivalent to A , i.e. the automata with a minimal number of states
that is equivalent to A .  
Changed:  
< <  If the input FST A is a transducer, this operation internally builds an equivalent transducer with a minimal number of states. However, this minimality is obtained by allowing transition having strings of symbols as output labels. Such transducers are not directly supported by the library. By defaut, Minimize will convert such transducer by expanding each stringlabeled transition into a sequence of transitions. This will results in the creation of new states, hence losing the minimality property. If a second output argument is given to Minimize , then the first output B will be the minimal transducer with each strings that is the output label being mapped to a new output symbol, the second output transducer C represents the mapping between new output labels and old output labels. Hence, we will have that A is equivalent to B o C .  
> >  If the input FST A is a transducer, this operation internally builds an equivalent transducer with a minimal number of states. However, this minimality is obtained by allowing transition having strings of symbols as output labels. Such transducers are not directly supported by the library. By defaut, Minimize will convert such transducer by expanding each stringlabeled transition into a sequence of transitions. This will results in the creation of new states, hence losing the minimality property. If a second output argument is given to Minimize , then the first output B will be the minimal transducer with each strings that is the output label of a transition being mapped to a new output symbol, the second output transducer C represents the mapping between new output labels and old output labels. Hence, we will have that A is equivalent to B o C .  
Usage 
Line: 1 to 1  

Minimize
Description  
Changed:  
< <  This operation performs the minimization of deterministic weighted automata and transducers.  
> >  This operation performs the minimization of deterministic weighted automata and transducers.
If the input FST
If the input FST  
Usage  
Line: 18 to 23  
Examples  
Added:  
> >  Acceptor minimization

A 
B 
Minimize(A, &B); fstminimize a.fst b.fst
 CyrilAllauzen  27 Feb 2009
META FILEATTACHMENT  attachment="minimize1.png" attr="" comment="Mimize example: input acceptor" date="1237320449" name="minimize1.png" path="minimize1.png" size="15468" stream="minimize1.png" tmpFilename="/var/tmp/CGItemp11490" user="CyrilAllauzen" version="2" 

META FILEATTACHMENT  attachment="minimize2.png" attr="" comment="Minimize example: output acceptor" date="1237320402" name="minimize2.png" path="minimize2.png" size="11111" stream="minimize2.png" tmpFilename="/var/tmp/CGItemp11424" user="CyrilAllauzen" version="2" 
Line: 1 to 1  

Minimize  
Line: 10 to 10  
template<class Arc>  
Changed:  
< <  Minimize(MutableFst  
> >  void Minimize(MutableFst  
 %DOX{namespacefst.html#Minimize[]}% 
fstminimize in.fst [out1.fst [out2.fst]]  
Line: 27 to 27  
 
Changed:  
< <  where V = # of states and E = # of transitions in the input Fst A .  
> >  where V = # of states and E = # of transitions in the input Fst.  
References 
Line: 1 to 1  

Minimize
Description  
Changed:  
< <  This operation performs the minimization of deterministic weighted automata and transducers.  
> >  This operation performs the minimization of deterministic weighted automata and transducers.  
Usage  
Line: 18 to 18  
Examples  
Changed:  
< <  TBA  
> >  TBA  
Complexity 
Line: 1 to 1  

Minimize  
Deleted:  
< <  This operation performs the minimization of deterministic weighted automata and transducers.  
Description  
Changed:  
< <  
> >  This operation performs the minimization of deterministic weighted automata and transducers.  
Usage  
Added:  
> > 
 
Examples  
Added:  
> >  TBA  
Complexity

Line: 1 to 1  

Minimize  
Line: 18 to 18  
Minimize
 
Changed:  
< < 
 
> > 
 
 
Added:  
> >  where V = # of states and E = # of transitions in the input Fst A .  
References 
Line: 1 to 1  

Added:  
> > 
MinimizeThis operation performs the minimization of deterministic weighted automata and transducers.
Description
Usage
Examples
Complexity
References
 CyrilAllauzen  27 Feb 2009 