Computer Science · Theory of Computation
Which of the following regular expressions represents the language accepted by a Deterministic Finite Automaton (DFA) that recognizes all strings over the alphabet {a, b} containing the substring 'abb'?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(a + b)* aab
- 2aba(a + b)
- 3b(a + b) b(a + b)* a(a + b)
- 4(a + b) abb(a + b)✓
Correct answer
(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