Computer Science · Theory of Computation
Which regular expression corresponds to a Deterministic Finite Automaton (DFA) accepting all strings over {a, b} starting with 'a' or starting with 'b' followed by 'a' or 'bab' repeatedly?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(a ∪ b(a ∪ bab))✓
- 2(a ∪ b(a ∪ bab))
- 3(a ∪ b(a ∪ bab))
- 4(a ∪ b(a ∪ bab))
Correct answer
(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
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