Consider the languages $L_1, L_2 \subseteq \sum^*$, where $\sum=\{a,b,c\}$. Define
$$L_1/L_2 = \{x : \exists y \in L_2\ such\ that\ xy \in L_1 \}$$
Let $L_1 = \{a^nb^nc^{2n}: n \ge 0\}$ and $L_2 = \{b^nc^{2n}: n \ge 0\}$.
Justify whether $L_1$ and $L_1/L_2$ are regular.
$L_1$ will not be CFL also as it needs more than one stack to count. $L_1/L_2$ gives concatenation and the result will be $a^{n} b^{2n} c^{4n}$ which is again non regular. Am I right? I am little bit confused for $L_1/L_2$ case as for some $y$, $xy$ belongs to $L_1$.