Computer Science · Theory of Computation
Consider the following statements about Context-Free Languages (CFL): Statement I: CFL is closed under homomorphism. Statement II: CFL is closed under complementation. Which of the following is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Neither Statement I nor Statement II is true
- 2Both Statement I and Statement II are true
- 3Statement II is true and Statement I is false
- 4Statement I is true and Statement II is false✓
Correct answer
Statement I is true and Statement II is false
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