Determine the minimum number of states contained in the DFA (Deterministic…
Determine the minimum number of states contained in the DFA (Deterministic Finite Automata) accepting "all strings that start with 0 and has odd length or start with 1 and has even length" over the alphabet Σ = {0, 1}.
Answer: 3
Attempted by 48 students.
Show answer & explanation
Correct answer: 3
Loading lesson…