3,525 views
6 votes
6 votes
Show that the language L={xy∣|x|=|y|,x≠y} is context free. Do not give links plz explain in simple manner

1 Answer

7 votes
7 votes
we can take it as wwr .

where x=w

and y=wr so |x|=|y| and it is cfl.

Related questions

1 votes
1 votes
1 answer
2
practicalmetal asked Mar 20, 2023
358 views
The complement of the languages:i) {ww | w in (0+1)*}ii) {$a^n b^nc^n$ | n>1} area) Context Free b) Not Context Free c)are DCFL’s d)None
0 votes
0 votes
1 answer
3
swami_9 asked Jul 16, 2022
525 views
Why the complement of a CFL is CSL?
1 votes
1 votes
1 answer
4
Abhipsa asked Jan 22, 2019
279 views
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is evenThanks!