|
|
| Name: |
DFA (deterministic finite automaton) |
| Base name: |
dfa |
| Description: |
Implement deterministic finite state machines |
| Related classes: |
state, alphabet, DFA |
| Version: |
1.0 |
| PHP version: |
5.0 |
| License: |
GNU General Public License (GPL) |
| All time users: |
327 users |
| All time rank: |
5543 |
| Week users: |
2 users |
| Week rank: |
1632 |
| |
|
 |
|
Innovation award
 Nominee: 1x |
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.
| There are not enough user ratings to display for this class. |
| |
Applications that use this class |
|
|
No application links were specified for this class.

If you know an application of this package, send a message to the
author to add a link here.
| |
Files |
|
|