1
$\begingroup$

This question already has an answer here:

In general, how can we go about proving that union of two languages as non regular. In this case, the individual languages can be proved as non regular using pumping lemma. How can we apply pumping lemma to union of two languages ?

$\endgroup$

marked as duplicate by Raphael Feb 6 '14 at 10:25

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

migrated from cstheory.stackexchange.com Feb 6 '14 at 3:21

This question came from our site for theoretical computer scientists and researchers in related fields.

  • $\begingroup$ If you need to know more than the linked question provides, please edit thus. $\endgroup$ – Raphael Feb 6 '14 at 10:26
1
$\begingroup$

Regular languages are closed under finite intersection, use that to your advantage. In this case, the reason the language isn't regular is because it has a $K = \{a^n b^n | n \geq 0 \}$ hidden inside it, pull it out using a regular language as a filter. More explicitly, notice that $K = L \cap a^*b^*$.

$\endgroup$