00:01
So basically in this question we have to construct a deterministic finite automata dfa for the given language.
00:06
So for each language here is a description that i provide.
00:10
So in the first question dfa language 1 state is q0, q1, q2.
00:14
Alphabet is a and b.
00:16
Transition is q0 start on a, q1.
00:19
Q1 on a, q1 on b, q2.
00:24
Q2 is the accepting state.
00:25
Now coming to the second question dfa language 2 state is q0, q1, q2, q3, q4 and alphabet is a and b.
00:34
Transition is q0 start on a, q1 on b, q3, q1 on a, q1 on b, q2, q2 on a, q1 on b, q3, q3 on a, q4 on b, q3 and q4 is the accepting state in this.
00:51
Now coming to the third part of this questions that is dfa language for language 3 and the state is q0, q1, q2, q3.
01:01
Alphabet is a and b.
01:03
Transition is q0 start on a, q1.
01:07
Q1 on b, q2...