How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language?
Answer is 20.
Please find the attachement for Explanation.
this is the solution of above question.
if any doubt then ask.
Hi ,
Pl find snapshot.