ISRO Scientist/Engineer SC (Computer Science)

Practice session

What is the minimum number of states in the minimal Deterministic Finite Automaton (DFA) that accepts the language L = { w ∈ {0, 1}* | w contains an even number of 0s and an even number of 1s }?

Loading your practice session…