Lecture 13_ DFA (Deterministic Finite Automata) with solved examples
In this lecture Deterministic Finite Automata (DFA) has been covered with help of examples. This lecture is also helpful in order to distinguish between NFA & DFA.
Remember 3 points for DFA
1) no empty string
2) No. of transaction from each sate is equal to number of letters given in alphabet.
For example, if ∑ = {a, b}. This alphabet has two letter i.e, a and b. That means from every state there will be two transaction. (two arrows on each state)
3) It may also contains reject state.
Reject state is a state which never allow us to reach final state.
#sherurecords