Question

How many minimum states are required in a dfa to find whether a given binary string has odd number of 0's or not, there can be any number of 1's?

Answer 1

'1' minimum state is required in dfa to find whether a given binary string has odd number of 0's or not, there can be any number of 1's.

This machine accept that languages which contain odd number of 0's and contain any number of 1's.  Here, the string which contains number of 0's should be divisible by 3 and the string which contains number of 1's should be divisible by 5.

Hope it helps!