The language L = (0n 1n 2n where n > 0) is a
| A. | context free language |
| B. | context-sensitive language |
| C. | regular language |
| D. | recursive enumerable language |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
