Difference between revisions of "NFA to DFA"

 
Line 16: Line 16:
  
 
""-> q1;
 
""-> q1;
−
q1->q2 [label="a"];
+
q1->q1 [label="a"];
 
q1->q2 [label="a"];
 
q1->q2 [label="a"];
 
q2 -> q2 [label="b"];
 
q2 -> q2 [label="b"];

Latest revision as of 21:02, 28 July 2014

Conversion

  • Q: I know that $2^n$ are the maximum states in DFA for an $n$ state NFA. But what about the minimum no of states in a DFA for an $n$ state NFA?

A: I would say 1 because the $n$ states can be connected through $ε$ moves and hence all of these will be combines to a single start state in DFA.

  • Q: After converting from NFA to DFA and we get $2^n$ states. Now we apply minimization- how many states can we get after this?

A: In the worst case this can remain $2^n$ - that is no minimization can be possible. We can see this in the following example

NFA

NFA

DFA

DFA
Retrieved from "https://gatecse.in/w/index.php?title=NFA_to_DFA&oldid=4152"


GATE

Code

Placement

Technical

Articles


This work is licensed under the CC By-SA 3.0 , without all the cruft that would otherwise be put at the bottom of the page.

Sister Sites: GATE CSE Wiki, GATE CSE, Aptitude Overflow