This class can be used to implement deterministic finite state machines.
It takes as parameters arrays that define the alphabet of symbols accepted as input and lists of all possible states and transitions.
The class takes a string a input symbols to process and determines if the final state is valid.
| There are not enough user ratings to display for this class. |
No application links were specified for this class.

If you know an application of this package, send a message to the
author to add a link here.