Computer Science · Theory of Computation
Consider the following language types: L1: Regular L2: Context-free L3: Recursive L4: Recursively enumerable Which of the following statements is NOT true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1L̄3 ∪ L4 is recursively enumerable
- 2L1 ∪ L̄2 is context-free✓
- 3L1 ∩ L2 is context-free
- 4L̄2 ∪ L3 is recursive
Correct answer
L1 ∪ L̄2 is context-free
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation