0

I'm trying to show that $L_6=\{c^n a^m b^p : n+m=p,p \geq 6\}$ is not regular. I need a little help, I was practicing the pumping lemma, and I encountered this language, I saw these conditions and got totally confused, what to do now?

Earlier I showed that $L_5=\{a^n b^n : n≄0\}$ is not regular. In this Language it was very simple to choose $w$, namely $w= a^pb^p$, where $p$ is the pumping length. But this new Language is complicated, so I thought you guys could help me out.

Raphael
  • 72,336
  • 29
  • 179
  • 389
Aniq
  • 129
  • 3
  • Cross-posted on math.se: http://math.stackexchange.com/questions/1210165/how-to-solve-complex-non-regular-language. – Yuval Filmus Mar 28 '15 at 15:06
  • Please don't cross-post on multiple SE sites; it violates site rules and is impolite to answerers (by fragmenting responses). – D.W. Mar 29 '15 at 20:25

1 Answers1

3

If $L_6$ were regular, then so would the following language be: $$ (L_6 \cap a^* b^*) \cup \{ \epsilon, ab, a^2b^2, a^3b^3, a^4b^4, a^5b^5 \}. $$ However, this language is none other than $L_5$.

You can also use the pumping lemma. Try to pump the word $c^qa^qb^{2q}$ for large enough $q$.

Yuval Filmus
  • 276,994
  • 27
  • 311
  • 503
  • @Yuval_Filmus Sorry, I didn't see your comment about the cross-posting and I gave more or less the same answer on math.stackexchange. – J.-E. Pin Mar 28 '15 at 21:01