Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
Line 16: | Line 16: | ||
""-> q1; | ""-> q1; | ||
− | q1-> | + | q1->q1 [label="a"]; |
q1->q2 [label="a"]; | q1->q2 [label="a"]; | ||
q2 -> q2 [label="b"]; | q2 -> q2 [label="b"]; |
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.
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
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.
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