Consider L = L1 ∩ L2 Where L1 = {0m1m20n1n |m, n >= 0} L2 = {0m1n2k | m, n, k ≥ 0} Then, the language L is
Consider L = L1 ∩ L2 Where L1 = {0m1m20n1n |m, n >= 0} L2 = {0m1n2k | m, n, k ≥ 0} Then, the language L is Correct Answer Context free but not regular
The correct answer is option 3.
Key Points
- L1 will first contain 0's followed by an equal number of 1's. After that, there will be a single 2 which will again be followed by 0's and an equal number of 1's i.e. L1={2,012,00112,20011,01201,0011201,0120011,001120011,........}
- L2={epsilon,0,1,2,01,12,012,00112,20011,01201,0011201,0120011,001120011,............}
- L=L1∩L2={2,012,00112,0001112,........}
- L=L1∩L2={0m1m2/ m>=0}, which is a context free language but not regular language.
∴ Hence the correct answer is Context-free but not regular.
Additional Information
[ alt="F1 Shraddha Raju 03.04.2021 D30" src="//storage.googleapis.com/tb-img/production/21/04/F1_Shraddha_Raju_03.04.2021_D30.png" style="width: 513px; height: 372px;">
মোঃ আরিফুল ইসলাম
Feb 20, 2025