![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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 |
A. | Not recursive |
B. | Regular |
C. | Context free but not regular |
D. | Recursively enumerable but not context free. |
Answer» C. Context free but not regular |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet