The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
174 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.4k points)
edited by | 174 views

3 Answers

+3 votes

Answer is 20.

Please find the attachement for Explanation.

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

this is the solution of above question.

if any doubt then ask.

by (121 points)
0
Thanks.. :)
0 votes

Hi ,

Pl find snapshot.

 

by (25 points)

Related questions

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
49,984 questions
55,135 answers
190,487 comments
85,107 users