- Let L ={0n 1n 2n|n ≥ 0}be alanguage over the alphabet{0,1,2}.
- Is L a regular language? In the case your answer is either YESor NO, prove your claim.
- Is L a context-free language? In the case your answer is eitherYES or NO, prove your claim.
- Is L a decidable language? In the case your answer is eitherYES or NO, prove your claim.
- Is L a Turing-recognizable language? In the case your answer iseither YES or NO, prove your claim.
Expert Answer
An answer will be send to you shortly. . . . .