Computer Science · Theory of Computation
The language L = {anbncn : n ≥ 1} is a context-sensitive language. Which of the following is a valid context-sensitive grammar for L?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1S → abc | aAbc A → bA A → Bbcc bB → Bb aB → aa | aaA
- 2S → abc | aAbc Ab → Ab Ac → Bbcc bB → Bb aB → aa | aaA
- 3S → abc | aAbc Ab → bA Ac → Bbcc bB → Bb aB → aa | aaA✓
- 4S → aSbc | aAbc Ab → bA Ac → Bbcc bB → Bb aB → aa | aaA
Correct answer
S → abc | aAbc Ab → bA Ac → Bbcc bB → Bb aB → aa | aaA
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