The alphabets are Σ={0,1}
Want to design a DFA that accept all strings with odd number of 0's and odd number of 1's is it possible?
Asked
Active
Viewed 3,468 times
0
-
Of course. You can write a DFA that accepts the strings with odd number of zeros, you can write a DFA that accepts the strings with odd number of ones, thus you should be able to write a DFA that accepts the strings with odd number of zeros and odd number of ones via the general construction for the DFA of $L_1\cap L_2$. – Sep 30 '17 at 06:37
-
Kindly tell me how, can you design? – Mohammad Umer Sep 30 '17 at 06:38
-
No, I am incapable of drawing on this site. – Sep 30 '17 at 06:53
-
What did you try? – J.-E. Pin Sep 30 '17 at 07:27
-
There's one with four states which is not hard to write down explicitly, where each state is labelled (even, even), (even, odd), (odd, even), and (odd, odd). Is this a hint enough? – Joppy Sep 30 '17 at 08:50