Subscribe to:
Post Comments
(
Atom
)
Prove that, D = (Q_D, Σ, δ_D, {q_0}, F_D) is the DFA constructed from NFA N = (Q_N, Σ, δ_N, q_0, F_N) by the subset construction, then L(D) = L(N).
Proved that, A language L is accepted by some DFA if and only if L is accepted by some NFA.
No comments
Dear Members, Thanks for Your Comments. We must be reply your comment answer as soon as possible. Please Stay with us.....