Prove that for every nfa with an arbitrary number of final states there is an equivalent nfa with only one final state. Can we make a similar claim for dfa's? From a language L we create a new language chopleft(L) by removing the leftmost symbol of every string in L. Specically, chople ft(L) = {u : vw e L, with | v= 1} Show that if L is regular, then chopleft (L) is also regular.