Deterministic Finite Automata

Definition :

               

 Important Points :

• Input string of symbols is read from left to right
• When the end of the string is reached, the string is accepted if the automaton is in one of the final states. Otherwise the string is rejected.
• The transitions from one internal state to another are governed by the transition function

Example:

This represent the DFA