The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
69 views
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ?
(a) 4       (b) 16     (c) 20       (d) 24
in Theory of Computation by Active (3.4k points)
retagged by | 69 views
0
is it 16?
0
what does designated initial state means ?
0
intial state can be chosen in only one way.
0
means if we select A as initial state in DFA1 then in DFA 2 also A will be the initial state ?

1 Answer

0 votes

case1:when no final state to be chosen.

    then dfa possible=2^4=16.

case2:when X is initial state and Y is final state but unreachable from X

  then dfa possible =2^2=4

therefore in total dfa possible is =16+4=20.Ans

by (101 points)

Related questions

0 votes
1 answer
3
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,833 questions
54,797 answers
189,483 comments
80,677 users