0 votes 0 votes closed as a duplicate of: Theory of computaion Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s. (a) 3 (b) 4 (c) 5 (d) 6 Can anyone draw the Dfa? :{ sahil_malik asked Oct 7, 2018 • closed Oct 7, 2018 by Mk Utkarsh sahil_malik 135 views comment Share Follow See all 0 reply Please log in or register to add a comment.