in Theory of Computation edited by
1,024 views
3 votes
3 votes

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?

  1. $4$
  2. $16$
  3. $20$
  4. $24$
in Theory of Computation edited by
by
1.0k views

3 Answers

6 votes
6 votes

Answer is 20.

Please find the attachement for Explanation.

edited by

2 Comments

Thanks.. :)
0
0

@ayushsomani how are the transition for the last four dfas defined...as the first state has all transitions to itself...so how is the state Y reachable?

0
0
4 votes
4 votes

this is the solution of above question.

if any doubt then ask.

1 comment

Thanks.. :)
0
0
1 vote
1 vote

Hi ,

Pl find snapshot.

 

Related questions