Let L₁ = {0^n+m1ⁿ0^m|n, m$\ge$0}. L₂ = {0^n+m1^n+m0^m|n, m$\ge$0} and L₃ = {0^n+m1^n+m0^n+m|n, m$\ge$0} Which of these languages are NOT context free?

Keep practicing — related questions

• Consider the languages L1 = {0i1j | i $\ne$ j}. L2 = {0i1j | i = j}. L3 = {0i1j | i = 2j +1}. L4 = {0i1j | ...
• Consider the following languages: L1 = {0p 1 q0r | p, q, r $\ge$ 0} L2 = {0p1q0r | p, p, r $\ge$ 0, p $\ne$...
• Consider the languages L1 {an bn cm | n, m > 0} and L2 {an bm cm | n, m > 0}
• Let L = L1 $\cap$ L2, where L1 and L2 are languages as defined below: L1 = $(a^m b^m\ ca^n b^m | m,n \ge 0)...
• Let L = L1 $\cap$ L2, where L1 and L2 are languages as defined below: L1 = $(a^m b^m\ ca^n b^m | m,n \ge 0)...
• The language {ambm+n | m,n $\le$ 1} is
• Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
• Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...