# Answer to Question #38160 in Other Math for Sujata Roy

Question #38160

The language L = {0^i 21^i | i <= 0} over the alphabet {0,1,2} is

(A) not recursive

(B) is recursive and is a deterministic CFL

(C) us a regular language

(D) is not a deterministic CFI but a CFL

(A) not recursive

(B) is recursive and is a deterministic CFL

(C) us a regular language

(D) is not a deterministic CFI but a CFL

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment