Finite Automata(FA) is the simplest machine to recognize patterns. The finite automata or finite state machine is an abstract machine that has five elements or tuples. It has a set of states and rules for moving from one state to another but it depends upon the applied input symbol. Basically, it is an abstract model of a digital computer. The following figure shows some essential features of general automation.
-
Notifications
You must be signed in to change notification settings - Fork 0
LazaroJPR/DFA-Simulator
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A DFA simulator produced in the LFA class in the Federal University of Espírito Santo
Resources
Stars
Watchers
Forks
Releases
No releases published