Problem with Closure properties of context free languages
- by altius
hello
i have the following sentence
a language L1={a^n * b^n : n=0} and L2={b^n * a^n : n=0} are context free languages so they are close a=under the L1L2 so L={a^n * b^2n A^n : n=0} must be context free too because it is generated by a close property
I have to prove if this sentence is true or not
so i check the L language and i do not think that it is context free then i also saw that L2 is L1 reversed
do i have to check if L1, L2 are deterministic ?
please help because i am in a dead end