Use the pumping lemma to show that the language is not regular

Question

I am working on this problem : Use the pumping lemma to show that the language $\{0^n 1^{n} \mid n ≥ 1\}$ is not regular. May someone give me some suggestion about how to solve this problem?

score 0 · Accepted Answer · answered May 23 '15 at 05:37

0

Suppose that $L=\{0^n1^{n+2}| n\geq1\}$ is regular and choose the word $\sigma=0^N 1^{N+2}$(with $N$ the pumping lemma constant) to find a contradiction.

answered May 23 '15 at 05:37

Renato Sanhueza

1,345
8
21

Use the pumping lemma to show that the language is not regular

1 Answers1