CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Let contains 01 and 011 as substring . The number of states in the minimal DFA corresponding to the complement of L is equal L={w|w[0,1];w to

Open in App
Solution

(b)
If it contains 011 as substring, then surely it will contain '01' as a substring.
Since the question asks for ¯¯¯¯¯¯¯¯¯¯¯¯¯¯L(M), we know that in a DFA, L(¯¯¯¯¯¯¯¯M) is same as ¯¯¯¯¯¯¯¯¯¯¯¯¯¯L(M),




So let's find the minimal DFA for L(M).
So, L(M) will be the answer.
¯¯¯¯¯¯¯¯¯¯¯¯¯¯L(M)=L(¯¯¯¯¯¯¯¯M)4 states
So option (b) will be answer

flag
Suggest Corrections
thumbs-up
2
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Salts
Watch in App
Join BYJU'S Learning Program
CrossIcon