CS390: applying the Pumping Lemma for Regular Languages - Old Dominion University Monarch Mediaspace

CS390: applying the Pumping Lemma for Regular Languages

From Steven Zeil

views comments

Example of using the Pumping Lemma to prove that a language is not regular.

…Read more Less…

Tags