DFSA: A class for representing a deterministic finite state automaton without epsilon transitions.
DFSAState Class for representing the state of a deterministic finite state automaton without epsilon transitions.
(D)FSA Transition Class for representing a transition in a weighted finite state transducer.
Minimization in n log n a la Hopcroft.
TransducerGraph Class for representing a deterministic finite state automaton without epsilon transitions.
An arc in a finite state transducer.
© 2002-2013 Stanford NLP Group