GATE | GATE CS Mock 2018 | Question 31

Consider the regular language La with input alphabets ‘a’ and ‘b’ in which count of ‘a’ and ‘b’ are odd as:

 La = {w∈{a,b}* ∣|w|a∈2N+1 and |w|b∈2N+1}

What will be the minimum number of states in DFA corresponding to La :
(A) 4
(B) 5
(C) 3
(D) 6

Answer: (A)

Explanation: DFA will be :
So, answer is 4 states.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.