Computer Science · Theory of Computation
नीचे दिए गए संदर्भ-मुक्त व्याकरण (context-free grammar) G पर विचार करें, जहाँ S प्रारंभिक गैर-टर्मिनल प्रतीक है, जबकि a और b टर्मिनल प्रतीक हैं।
S → aSb | T
T → bT | b
G द्वारा उत्पन्न भाषा (language) कौन सी है?
S → aSb | T
T → bT | b
G द्वारा उत्पन्न भाषा (language) कौन सी है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1{a m b n : 0 ≤ n}
- 2{a m b n : 0 < n ≤ m}
- 3{a m b n : 0 < m < n}
- 4{a m b n : 0 ≤ m < n}✓
सही उत्तर देखें
{a m b n : 0 ≤ m < n}
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 Computer Science 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