RGPV 2009 Q. Construct minimized DFA for the given NFA. Or Convert the following NFA into DFA. Ans. Transition table for given NFA State Input a B è q0 q0, q1 q0 q1 q2 q1 q2 q3 q3 q3 – q2 Transition table for DFA from given NFA table State Input a B è [q0] […]

### Category: RGPV NFA to DFA

## Construct DFA equivalent to NFA | RGPV TOC PYQ

RGPV 2014Q. Construct DFA equivalent to the NFAM = ({p, q, r, s}, {0, 1}, δ, p, {q, s})Where δ is defined in the following table. δ 0 1 p {q, s} {q} q {r} {q, r} r {s} {p} s – {p} Ans. State 0 1 [p] [q, s] [q] [q] [r] [q, r] [q, s] […]