Dfa (deterministic finite automaton) Php Class

Algorithms: DFA (deterministic finite automaton)
Hamed Afshar (contact me)
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.

Click here for detailed information about this class on phpclasses.org