Possible Duplicate:
How to prove that a language is not regular?
Given a language $L = \{a^pb^{2p} \mid p \ge 1\}$, how could I show, using the Pumping Lemma that $L$ is not regular?
Asked
Active
Viewed 63 times
1
-
This is a fairly standard exercise -- it appears in both computability texts I have. Is it homework? Do you understand how to make use of the pumping lemma? – David Jun 04 '12 at 02:48
-
It is part of an exercise list to help people study for the exam. And no, I don't know exactly how to make use of the pumping lemma :) – maxxtack Jun 04 '12 at 02:56
-
check http://cs.stackexchange.com/q/1031/157 – Ran G. Jun 04 '12 at 02:57
-
Without further detail -- your attempt and a specific question -- this is question does not ask for more than the reference question. Please check there; if you continue to have problems, you can edit the question accordingly and flag for reopening. – Raphael Jun 04 '12 at 08:25