retagged by
257 views
0 votes
0 votes
For the definition of the shuffle operation. For languages $A$ and $B,$ let the $\text{shuffle}$ of $A$ and $B$ be the  language $\{w| w = a_{1}b_{1} \ldots a_{k}b_{k},$ where  $ a_{1} · · · a_{k} ∈ A $ and $b_{1} · · · b_{k} ∈ B,$ each $a_{i}, b_{i} ∈ Σ^{*}\}.$

Show that the class of context-free languages is not closed under shuffle.
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
admin asked Oct 12, 2019
244 views
Let $A = \{wtw^{R}\mid w,t\in\{0,1\}^{\ast}\:\text{and} \mid w \mid = \mid t \mid \}$. Prove that $A$ is not a CFL.
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4
admin asked Oct 12, 2019
258 views
Read the definitions of NOPREFIX(A) and NOEXTEND(A) in Question $1.40$.Show that the class of CFLs is not closed under NOPREFIX.Show that the class of CFLs is not closed ...