DFA (deterministic finite automaton) 1.0

DFA (deterministic finite automaton) can be used to implement deterministic finite state machines.

DFA takes as parameters arrays that define the alphabet of symbols accepted as input and lists of all possible states and transitions. It takes a string a input symbols to process and determines if the final state is valid.

Requirements:
PHP 5.0 or higher

License type: GNU General Public License
Date added: 5 years, 5 months 23 days ago | Last updated: 3 years, 9 months 27 days ago

More popular Algorithm

This is actually one of the most advanced image hosting script. The imagetize key features: SEO, Ads Ready, Admin
Hot Scripts
Sponsors