DFA (deterministic finite automaton) 1.0
Developed by Hamed Afshar, listed in Algorithm
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: 4 years, 1 month 19 days ago | Last updated: 2 years, 5 months 23 days ago
More popular Algorithm
- Love Calculator 1.0 (2 years, 5 months 22 days ago)
- Binary Tree Algorithms 1.0 (2 years, 5 months 22 days ago)
- Fast Fourier Transform 0.1 (2 years, 5 months 23 days ago)
- Kruskal 1.0 (7 years, 8 months 15 days ago)
- RCD Script 1.0 (2 years, 5 months 22 days ago)
This is actually one of the most advanced image hosting script. The imagetize key features: SEO, Ads Ready, Admin
Hot Scripts
- Mysql Ajax Table Editor
- PHP DataGrid
- Console App
- AJAX Login Module
- Form Tools
- Amba XML document
- LimeSurvey
- ajaxCRUD
- XLS Export
- SuperCali PHP Event Calendar
Sponsors
- FREE MySQL Cloud Database Super Simple, Zero-Management MySQL Cloud DB. Use It FREE!
- Pinterest clone Start your own pin board social network today. Get Pintastic and start your own pinterest clone network.
- MYRE Real Estate Software Professional Real Estate solutions by MYREPHP PROGRAMMING!
