Theory of Computation20785 marksApplication of Pumping Lemma
Show that L = {ana^nan | n is a prime number} is not a regular language.
Show that L = {ana^nan | n is a prime number} is not a regular language. [5]
Note: The language can be simplified as L = {a^(3n) n is prime}, i.e., strings of a's whose length is 3 times a prime number. --- If A is a regular language, then there exists a pumping length p such that any string s in A with s = p can be written as s = xyz, satisfying: 1. xy^i z ∈ A for every ...