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