DFA

• In DFA, every state will have a single transition for every symbol.

• ϵ- moves is not accepted in DFA

• So, the transition table will not have ø

1. Construct DFA with its transition graph and transition table for the RE (0+1)* 01
   Here , Σ= {0,1}

Transition graph

Transition table

Note:
In DFA, each entry of the transition table will have exactly one entry

2. Construct DFA with its transition graph and transition table for the RE (a+b)* abb
   Here, Σ= {a,b}

Transition graph

Transition table

3. Construct DFA with its transition graph and transition table for the RE (a | b)^* abba
   Here, Σ= {a,b}

​​​​​​​Transition graph

Transition table

4. Construct DFA with its transition graph and transition table for the set of strings over {0,1} whose length is divisible by 4.

Transition graph

Transition table

5. Construct DFA with its transition graph and transition table for the regular expression 
   a b(a | b)*

Transition graph

Transition table

DS represents Dead State

6. Construct DFA with its transition graph and transition table for  L={ an bm cp | n,m,p ≥ 1 }

Transition graph

Transition table

DS represents Dead State