Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’, A’), which among the following is true?
(a) Q’ = P(Q)
(b) Δ’ = δ’ (R, a) = {q ϵ Q | q ϵ δ (r, a), for some r ϵ R}
(c) Q’={q0}
(d) All of the mentioned
The question was asked in an interview for job.
I would like to ask this question from Applications of DFA in chapter Finite Automata of Automata Theory