Package edu.stanford.nlp.fsm

Interface Summary
AutomatonMinimizer  
Block<E>  
TransducerGraph.ArcProcessor  
TransducerGraph.GraphProcessor  
TransducerGraph.NodeProcessor  
 

Class Summary
DFSA<T,S> DFSA: A class for representing a deterministic finite state automaton without epsilon transitions.
DFSAState<T,S> DFSAState

Class for representing the state of a deterministic finite state automaton without epsilon transitions.

DFSATransition<T,S> (D)FSA Transition

Class for representing a transition in a weighted finite state transducer.

FastExactAutomatonMinimizer Minimization in n log n a la Hopcroft.
QuasiDeterminizer QuasiDeterminizer.
TransducerGraph TransducerGraph

Class for representing a deterministic finite state automaton without epsilon transitions.

TransducerGraph.Arc<NODE,IN,OUT>  
TransducerGraph.InputSplittingProcessor  
TransducerGraph.NodeProcessorWrappingArcProcessor  
TransducerGraph.NormalizingGraphProcessor  
TransducerGraph.ObjectToSetNodeProcessor  
TransducerGraph.OutputCombiningProcessor  
TransducerGraph.SetToStringNodeProcessor  
 



Stanford NLP Group