Describe a (general) procedure that, given some finite automaton M, produces a new finite automaton M with:  M rejects , but accepts otherwise the identical language as M does.Note that M may or may not accept , while M does not!My solution is to discuss the different cases. If M doesn't contain , then, don't need to produce a new M', but if M contains -transition, then convert it to DFA. I'm not sure my procedure is right or not.Can someone come up with some more effective idea?
Given NFA to recognize a language, construct a new NFA for that language without the empty string
automata;finite automata