Interface Summary |
DFA |
The "Deterministic Finite Automaton" (DFA ) interface
abstracts a Moore state machine used to recognize discrete
sequences of symbols (usually character symbols). |
DFAConstructor |
Algorithms which are capable of generating a DFA from
a RegularSet can be encapsulated by the
DFAConstructor interface. |
DFATransformer |
Algorithms which are capable of transforming some other object into
a DFA can be encapsulated by the
DFATransformer interface. |
Declares interfaces which model and support deterministic finite automata.