Does a pushdown automata exists for the following language?

Question

I have came across a question stating that language $L = a^n b^n c^{2n}$ is not a context free language and hence, no PDA can be constructed for it. But what I am wondering is that, if I add another alphabetical comparison to the above language as

$L_1= a^n b^n c^{2n} d^n$
$L_2= a^n b^{2n} c^n d^{2n}$

And a mixture of above will lead to cfg. Because now we have two comparison so not only we can push the symbol but with the help of other symbol we can pop it so as to empty the stack implies to acceptance of the strings.
my question is I do not know that whether my assertion to the modification of the language is right or wrong so please if you can tell me where iam wrong or right it would be helpful.
One more thing if iam right, then please show the cfg production to derive them as I can make PDA for them( if iam right) but finding hard to assign production the accepts the above cgl language ( if its then) Thanks

I'd suggest you fix the grammar in your question - as it stands, it's a bit difficult to understand what you are trying to ask. — Gokul, Aug 29 '18 at 03:46
I did not get you, like iam asking that the modification of non cfl = ( a^n b^n c^n) to (a^n b^n c^n d^n) will make the later a cfl or not — rballiwal, Aug 29 '18 at 04:19
Your new languages are also not context-free. You can prove it using the pumping lemma. — Yuval Filmus, Aug 29 '18 at 04:30
See our reference question for detailed explanations on how to prove that your language is not context-free. — Raphael, Aug 29 '18 at 11:49

score 2 · Answer 1 · answered Aug 29 '18 at 12:44

Your languages are still not context-free.

A string homomorphism is a function $f\colon \Sigma \to \Sigma^*$ that replaces each character in a string with a (possibly empty) string over the same alphabet. For a string $w=w_1\dots w_\ell$, we define $f(w)= f(w_1)\cdots f(w_\ell)$. Context-free languages are closed under string homomorphisms. That is, if a language $X$ is context free, so is the language $\{f(w)\mid w\in X\}$ for any string homomorphism $f$.

So, suppose that either of your languages were context-free, and consider the homomorphism defined by $f(a)=a$, $f(b)=b$, $f(c)=c$, $f(d)=\varepsilon$. We have $f(L_1)=\{a^nb^nc^{2n}\mid n\geq 0\}$ and $f(L_2) = \{a^nb^{2n}c^n\mid n\geq 0\}$. Neither of these is context free, which contradicts the assumption that $L_1$ and $L_2$ are context-free.

Also "a mixture" is not a well-defined context-free operation. In general, you should be suspicious of arguments where the main step is just some hand-wave along the lines of "And, yeah, then surely we can just combine them." If it's easy to explain how to "just combine them", then the argument can easily state that; if it's not easy to explain how, then it certainly needs to be explained!

Does a pushdown automata exists for the following language?

1 Answers1