Computer Science · Theory of Computation
निम्नलिखित में से कौन सा संदर्भ-मुक्त व्याकरण (context-free grammar) नियमित व्यंजक (regular expression) (a + b) abb (a + b)* द्वारा दर्शाई गई भाषा को उत्पन्न करता है, जहाँ ∈ नल स्ट्रिंग को दर्शाता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1S → Aabb, A → aA | bA | ∈
- 2S → AabbA, A → aA | bA | ∈✓
- 3S → abbA, A → aA | ∈ | bA
- 4S → AabbB, A → aA | ∈, B → bB | ∈
सही उत्तर देखें
S → AabbA, A → aA | bA | ∈
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