The Gateway to Computer Science Excellence
+2 votes
215 views

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 by Active (3.5k points)
edited by | 215 views

3 Answers

+4 votes

Answer is 20.

Please find the attachement for Explanation.

by Active (1.1k points) 1 flag:
✌ Edit necessary (nadeshseen “please, rotate the image and then upload image”)
0
Thanks.. :)
+3 votes

this is the solution of above question.

if any doubt then ask.

by (189 points)
0
Thanks.. :)
+1 vote

Hi ,

Pl find snapshot.

 

by (35 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,497 answers
195,490 comments
100,816 users