πŸ“Š Theory of Computation and Compiler Design
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.
πŸ’¬ Discuss
βœ… Correct Answer: (C) Context free but not regular

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
1041
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
88%
Success Rate