Computer Science · Theory of Computation
निम्नलिखित में से कौन सा नियमित व्यंजक (regular expression) उस भाषा को दर्शाता है जो वर्णमाला {a, b} पर उन सभी स्ट्रिंग्स को स्वीकार करती है जिनमें सबस्ट्रिंग 'abb' शामिल है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(a + b) abb(a + b)✓
- 2b(a + b) b(a + b)* a(a + b)
- 3aba(a + b)
- 4(a + b) aab
सही उत्तर देखें
(a + b) abb(a + 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