Using pumping lemma show that the language L consisting of all string of l's whose length is a prime is not a regular language.

Subject Theory of Computation
NU Year Set: 2.(a) Marks: 8 Year: 2011
Login to post your comment.