Computer Science · Theory of Computation
Given below are two statements regarding Context-Free Languages (CFLs): Statement I: The family of context-free languages is closed under homomorphism. Statement II: The family of context-free languages is closed under reversal. In light of the above statements, choose the correct answer:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement I is false but Statement II is true
- 2Statement I is true but Statement II is false
- 3Both Statement I and Statement II are false
- 4Both Statement I and Statement II are true✓
Correct answer
Both Statement I and Statement II are true
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