Computer Science · Theory of Computation
कौन सा रेगुलर एक्सप्रेशन (Regular Expression) उस ऑटोमेटा को निरूपित करता है जो (a ∪ b(a ∪ bab)) भाषा को स्वीकार करता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(a ∪ b(a ∪ ba*b))
- 2(a ∪ b(a ∪ bab))
- 3(a ∪ b(a ∪ bab))
- 4(a ∪ b(a ∪ bab))✓
सही उत्तर देखें
(a ∪ b(a ∪ bab))
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