In this lecture of thoery of automata we will learn how to design dfa for all string type questions. you will learn dfa design process, dfa design questions, dfa design in automata for all strings with examples also from regular expression in theory of automata or theory of computation.

Now we will draw dfa with examples and learn how to make dfa diagram, Let’s draw the dfa for the following languages:

1. Design dfa for all strings when Σ = {a}.

2. Design dfa for all strings when Σ = {a,b}

3. Design dfa for all strings when Σ = {a,b,c}