CAT 2024 Last Batch ๐งโ๐ Starts on Monday (22nd July). Enroll now
Edit MetaData
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?
$$L_3 \cap L_1$$ is recursive
$$L_1 \cap L_2 \cap L_3$$ is recursive enumerable
$$L_1 \cup L_2$$ is context free
$$L_1 \cap L_2$$ is context free
Create a FREE account and get:
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Detailed syllabus & Topic-wise Weightage
By proceeding you agree to create your account
Free CAT Syllabus PDF will be sent to your email address soon !!!