2

$L_1=\{a^ncb^n\} \cup \{a^mdb^{2m}\}$

$L_2 = \{ a^{2n}cb^{2m+1} \} \cup \{a^{2m+1}db^{2n}\}$

This is my exam question on two days ago. Option is:

$1)$ $L_1 \cap L_2$ is Regular Language.

$2)$ $L_1 \cap L_2$ is not a Context free.

$3)$ $L_1 \cap L_2$ is Non deterministic Context Free.

$4)$ $L_1 \cap L_2$ is deterministic Context Free and not Regular.

My teacher gives a short solution answer and $(4)$ is correct choice. anyone could describe me why? how we can inference this difficult question?

Moji Moji
  • 53

2 Answers2

1

A slightly different approach to the problem is to let $$\begin{align} X_1 &= \{a^ncb^n\mid n\ge 0\}\\ X_2 &= \{a^{2n}cb^{2m+1}\mid n, m\ge 0\}\\ Y_1 &= \{a^mdb^{2m}\mid m\ge 0\}\\ Y_2 &= \{a^{2m+1}db^{2n}\mid n, m\ge 0\} \end{align}$$ so $$ L_1 = X_1\cup Y_1\quad\text{and}\quad L_2=X_2\cup Y_2 $$ and thus $$ L_1\cap L_2=(X_1\cap X_2)\cup(X_1\cap Y_2)\cup(X_2\cap Y_1)\cup(Y_1\cap Y_2) $$ Now observe that $X_i\cap Y_j=\varnothing$, since every string in $X_i$ contains $c$ and no string in $Y_j$ does, so $L_1\cap L_2=(X_1\cap X_2)\cup(Y_1\cap Y_2)$.

Further, it's not hard to show that $X_1\cap X_2=\varnothing$, so $$\begin{align} L_1\cap L_2&=Y_1\cap Y_2\\ &=\{a^idb^j\mid i=2m+1\land j=2i\}\\ &=\{a^{2m+1}db^n\}\cap\{a^jdb^{2j}\}\\ &=Z_1\cap Z_2 \end{align}$$ Clearly $Z_1$ is regular and $Z_2$ is a DCFL so their intersection is a DCFL. Finally, an easy pumping lemma proof establishes that $Z_1\cap Z_2$ isn't regular, so answer (4) is correct, as expected.

Rick Decker
  • 8,787
  • Your answer is so nice, but one problem, you are so expert but I'm not, you say "an easy pumping lemma proof " can you show me to learn? – Moji Moji Aug 03 '16 at 19:15
  • @MojiMoji. It usually takes me an hour or so to cover the pumping lemma for regular languages, so any tutorial would be much longer than would be appropriate here. I'd suggest that you find a proof that the language $a^nb^n$ isn't regular (almost any text will have it) and modify it slightly for the problem at hand. – Rick Decker Aug 03 '16 at 19:34
  • Owww, Ok, I‌ get it. Would you please let me to study. thanks so much. – Moji Moji Aug 03 '16 at 19:35
  • 2
    @MojiMoji: There’s a pumping lemma proof here that ${a^nb^n:n\ge 0}$ isn’t regular. – Brian M. Scott Aug 03 '16 at 19:51
  • 1
    Wow @BrianM.Scott Thanks, I read in 30 hours on it, but couldn't generalize it on my specific question, Would you please show it on my specific question?. I need a great answer (also this answer is), but I means even it maybe long, but it's valuable to learn others some long answer or some proof that show creativity and not directly deduced in some question. – Moji Moji Aug 03 '16 at 19:58
  • @MojiMoji: Here is another example of a pumping lemma proof, and here and here are two more. – Brian M. Scott Aug 03 '16 at 19:59
  • @BrianM.Scott I know about it but not professional to generalize it on my question, maybe this is my challenge. – Moji Moji Aug 03 '16 at 20:00
0

First realize that $L_1$ is context free and $L_2$ is regular. Can you see why? Once you realize this, just use simple closure properties (a quick wikipedia search of context free languages will help you build a closure chart). Since all four answers list intersections, you know that a context free language intersected with a regular language is in fact context free (and not regular in this case), so answer 4) is the correct answer.

EDIT: $L_1$ is context-free and you can show it by coming up with a CFG for the language. For $L_1$, a grammar could be

$S \rightarrow C|D\\ C\rightarrow c | aCb\\ D\rightarrow d | aDbb$

I assume $n\ge 0$ and $m \ge 0$.

For $L_2$, you can come up with an NFA for $L_3 = \{a^{2n}cb^{2m+1}\}$ and $L_4 = \{a^{2m+1}db^{2n}\}$ and connect them with epsilon transitions.

m1cky22
  • 637