Package edu.stanford.nlp.fsm

Old finite state machine implementation -- will be replaced with the future graphs package.

See:
Description

Class Summary

DFSA	DFSA Class for representing a deterministic finite state automaton without epsilon transitions.
DFSAMinimizer	DFSAMinimizer Class for minimizing (unweighted) deterministic finite state automata.
DFSAState	DFSAState Class for representing the state of a deterministic finite state automaton without epsilon transitions.
DFSATransition	(D)FSA Transition Class for representing a transition in a weighted finite state transducer.

Package edu.stanford.nlp.fsm Description

Old finite state machine implementation -- will be replaced with the future graphs package.