The number of states needed in minimal DFA accepting language L be the set of…
The number of states needed in minimal DFA accepting language L be the set of all binary strings whose last two symbols are different ?
Answer: 5
Attempted by 53 students.
Show answer & explanation
Correct answer: 5
Loading lesson…