in Theory of Computation
172 views
0 votes
0 votes
number of 3 state dfa with designated initial stat can be constructed over the alphabet {0,1,2} with exactly 2 final states is

a)3^8

b)3^9

c)3^10

d)3^11
in Theory of Computation
by
172 views

1 Answer

3 votes
3 votes

I think the answer is  C.

reshown by