Computer Science · Theory of Computation
Match the context-free grammars in List I with the correct length specification of strings in the language generated by them in List II (where n ≥ 1): LIST - I (Grammar)LIST - II (Length of generated strings)A. S → aSa | aaI. ((2n × 3) - 4) ; n ≥ 1B. S → aaSaa | aaII. 2n ; n ≥ 1C. S → aaaSaaa | aaIII. ((4 × 2n) - 6) ; n ≥ 1D. S → aaaaSaaaa | aaIV. 4n - 2 ; n ≥ 1 Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - II, B - III, C - I, D - IV
- 2A - I, B - IV, C - III, D - II
- 3A - II, B - IV, C - I, D - III✓
- 4A - IV, B - III, C - I, D - II
Correct answer
A - II, B - IV, C - I, D - III
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