| Interface | Description |
|---|---|
| AutomatonMinimizer | |
| Block<E> | |
| TransducerGraph.ArcProcessor | |
| TransducerGraph.GraphProcessor | |
| TransducerGraph.NodeProcessor |
| Class | Description |
|---|---|
| DFSA<T,S> |
DFSA: A class for representing a deterministic finite state automaton
without epsilon transitions.
|
| DFSAState<T,S> |
DFSAState represents the state of a deterministic finite state
automaton without epsilon transitions.
|
| DFSATransition<T,S> |
DFSATransition represents a transition in a weighted finite state
transducer.
|
| FastExactAutomatonMinimizer |
Minimization in n log n a la Hopcroft.
|
| QuasiDeterminizer |
QuasiDeterminizer performing quasi-determinization on TransducerGraphs.
|
| TransducerGraph |
TransducerGraph represents a deterministic finite state automaton
without epsilon transitions.
|
| TransducerGraph.Arc<NODE,IN,OUT> |
An arc in a finite state transducer.
|
| TransducerGraph.InputSplittingProcessor | |
| TransducerGraph.NodeProcessorWrappingArcProcessor | |
| TransducerGraph.NormalizingGraphProcessor | |
| TransducerGraph.ObjectToSetNodeProcessor | |
| TransducerGraph.OutputCombiningProcessor | |
| TransducerGraph.SetToStringNodeProcessor |