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.
The above figure shows the following features of automata:
- Input
- Output
- .States of automata
- State relation
5. Output relation
Types of finite automata
Deterministic finite automata (or DFA) are finite state machines that accept or reject strings of characters by parsing them through a sequence that is uniquely determined by each string. The term “deterministic” refers to the fact that each string, and thus each state sequence, is unique.
A nondeterministic finite automation, or nondeterministic finite-state machine, is a finite-state machine that does not need to obey the restrictions set by DFA, where each of the transition is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition
