Computer Science · Theory of Computation

Which set of context-free grammar production rules correctly generates the language L = {aibj | i > j ≥ 0}?

Verified Solution4 OptionsUpdated: October 2026👁️1 View

1S → aSb | aS | a✓
2S → aSb | bS | b
3S → abS | b
4S → abS | bS | b

Correct answer

S → aSb | aS | a

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

Preparing for Computer Science?

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Start Free Mock Test →

Chapter Practice

Want more practice questions on Theory of Computation?

Solve complete topic-wise tests with detailed solutions on GkGet.

Practice Theory of Computation MCQs →

Recommended practice questions in Computer Science · Theory of Computation

Browse More Computer Science →

Which Indian independence movement leader was primarily known for his philosophy and practice of non-violent civil disobedience?

Solve Question→

Who gave the call for 'Do or Die' during the Quit India Movement in 1942?

Solve Question→

Which of the following revolutionary pairs were imprisoned together in Cellular Jail and faced harsh conditions, contributing significantly to the Indian independence movement?

Which set of context-free grammar production rules correctly generates the language L = {aibj | i > j ≥ 0}?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

Which set of context-free grammar production rules correctly generates the language L = {aibj | i > j ≥ 0}?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Related Practice Questions

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions