Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 432 Bytes

File metadata and controls

2 lines (2 loc) · 432 Bytes

DFA Simulator

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.