Consider the language L such that L accepts set of all strings of even length…
Consider the language L such that L accepts set of all strings of even length (greater than zero) over Σ = {0, 1, 2}. The total number of states in the minimal DFA of the language L is/are ______.
Answer: 3
Attempted by 38 students.
Show answer & explanation
Correct answer: 3
Loading lesson…