retagged by
583 views
2 votes
2 votes

Q C4 b) If it is known that the language L1=$\left \{ 0^{n}1^{n}2^{i}\mid n\neq i \right \}$ is not a context free language  (CFL). Now consider the language L2=$\left \{ 0^{i}1^{n}2^{n}\mid i\neq n \right \}$. We can prove that L2 is not CFL by converting L2 into L1 by applying two operation, both know to be closed on CFLs. What are two operation you will use for this construction.

retagged by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
0 answers
2
go_editor asked May 31, 2016
428 views
Let $S = \{x \in R : 1 \leq |x| \leq 100\}$. Find all subsets $M$ of $S$ such that for all $x, y$ in $M$, their product $xy$ is also in $M$.
4 votes
4 votes
2 answers
3
go_editor asked May 31, 2016
1,556 views
Find the value of $ \Sigma ij$, where the summation is over all integers $i$ and $j$ such that $1 \leq i < j \leq 10$.
1 votes
1 votes
0 answers
4
go_editor asked May 31, 2016
401 views
The vertices of a triangle $T$ are given. For an arbitrary point $P$ in the plane, give an algorithm to test if $P$ belongs to the interior of $T$. (The interior of $T$ d...