edited by
952 views
6 votes
6 votes

An NFA has $10$ states out of which $3$ are final states. The maximum number of final states in converted DFA is:

  1. $895$
  2. $894$
  3. $896$
  4. $897$
edited by

1 Answer

Best answer
10 votes
10 votes

There are 3 final states in total 10 states .

7 are non final states , so all these state which come together to form a state in dfa are not have any finale state in dfa.  .

so possible DFA state with only these 7 Non final states are 27 = 128

and total 210  =  1024 states are possible 

so total number of state which contain final state is 1024 - 128 = 896

option C is true here.

selected by
Answer:

Related questions

6 votes
6 votes
2 answers
1
Bikram asked Nov 26, 2016
1,174 views
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is:DecidableUndecidable but semi-decida...
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
294 views
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an:Decidable prob...
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
201 views
Recursive Enumerable Languages are NOT closed under :UnionIntersectionComplementHomomorphism
0 votes
0 votes
1 answer
4