The program takes a deterministic automata machine table as input either by console or read from a file,after the table has been fed and
final states(s) is defined the program can validate strings against the table as accepted or un accepted
below is an example of a automata machine that only accepts even nummbers
-
Notifications
You must be signed in to change notification settings - Fork 0
QAZI-98/Automata-validator-
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
A program to verify strings against Deterministic Finite Automata tables
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published