Computer Science · Theory of Computation
Consider the following Context-Free Grammar (CFG): S → aB | bA A → b | aS | bAA B → a | bS | aBB Which language property is satisfied by all terminal strings generated by this CFG?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Strings with an odd number of a's and even number of b's
- 2Strings with an odd number of a's and odd number of b's
- 3Strings with an even number of a's and even number of b's
- 4Strings with an equal number of a's and b's✓
Correct answer
Strings with an equal number of a's and b'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