Question: Answer question 18 only please. Find an nfa that accepts {a}* and is such that if in its transition graph a single edge is removed

Answer question 18 only please.
Find an nfa that accepts {a}* and is such that if in its transition graph a single edge is removed (without any other changes), the resulting automaton accepts {a}. Can Exercise 17 be solved using a dfa? If so, give the solution; if not, give convincing arguments for your conclusion
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
