Question: consider the nfa constructed for a^2n U a^3n language. Apply the nfa to dfa procedure and see how many states you get for the dfa
consider the nfa constructed for a^2n U a^3n language. Apply the nfa to dfa procedure and see how many states you get for the dfa (11?). Apply the minimization concept to the DFA and see whether you get 7 states for the language a^{2n} U a^{3n}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
