Computer Science · Theory of Computation
Any string of terminals that can be generated by the following context-free grammar (where S is the start nonterminal symbol) will satisfy which property? S → XY X → 0X | 1X | 0 Y → Y0 | Y1 | 0
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1has at least one 1
- 2should end with 0
- 3has no consecutive 0's or 1's
- 4has at least two 0's✓
Correct answer
has at least two 0's
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