Sign in
Please select an account to continue using cracku.in
↓ →
Let $$L_1$$ be regular language, $$L_2$$ be a deterministic context free language and $$L_3$$ a recursively enumerable language, but not recursive. Which one of the following statements is false?
Create a FREE account and get: