Computer Science · Theory of Computation
Which of the following grammars generates the language L = { aibjck | i ≠ k, and i, j, k ≥ 1 }?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1S → AC | CB A → aA | ε B → Bc | ε C → aCc | ε | bD D → bD | b | ε
- 2S → AB A → aAb | ab B → bBc | bc
- 3S → aS | aA A → bA | bB B → CB | c
- 4S → AC | CB A → aA | a B → Bc | c C → aCc | bD | b D → bD | b✓
Correct answer
S → AC | CB A → aA | a B → Bc | c C → aCc | bD | b D → bD | b
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