DFA (deterministic finite automaton)
Package:
Summary:
Implement deterministic finite state machines
Groups:
Author:
Description:
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.
Comments are closed.