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:
Book Free CAT Mentorship
Get personalized CAT strategy from a 99%iler
500+ students mentored
OTP Verification
Enter the 6-digit code sent to your phone
Booking Summary
Enter OTP
Didn't receive the OTP?
Educational materials for CAT preparation