IMPORTANT * All three methods of defining languages regular expression, acceptance by finite automata and acceptance by transition graph are equivalent KLEENE’S THEOREM…
