Computer Science · Theory of Computation
Consider the context-free grammar G given below, where S is the starting non-terminal symbol, while a and b are terminal symbols: S → aaSb | T T → Tb | a Which of the following statements is true about the language L(G) generated by G?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1aabbaabb belongs to L(G) but aabb does not
- 2aaaaabbb belongs to L(G) but aaaabb does not✓
- 3aaaabb belongs to L(G) but aabbaabb does not
- 4aaabb belongs to L(G) but aaaaabbb does not
Correct answer
aaaaabbb belongs to L(G) but aaaabb does not
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