kikipie731 kikipie731 Today at 9:51 AM Computers and Technology Answered Prove any language of your choice is regular with the Myhill-Nerode theorem. Could you have done the proof (of regularity) with the Pumping Lemma?