| Recommend this page to a friend! |
| Classes of Hamed Afshar | > | DFA (deterministic finite automaton) | > | Download .tar.gz .zip | > | > | > | |||||
|
| ||||||||||||||||||||||||||||||||||||||||||||
| Detailed 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. |
| Groups | ||
| Algorithms | Numerical and statistical algorithms | View top rated classes | |
| PHP 5 | Classes using PHP 5 specific features | View top rated classes |
| Applications | ||||||
No application links were specified for this class.
|
||||||||||||||||||||||||||||||