Q. Let L = L1 \cap L2, where L1 and L2 are languages as defined below: L1 = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 } L2 = {a^{i}b^{j}c^{k} | i, j, k >= 0 } Then L is (Solved)
1. Not recursive
2. Regular
3. Context free but not regular
4. Recursively enumerable but not context free.
- c. Context free but not regular