Computer Science · Theory of Computation
Which of the following regular expressions represents the language containing all strings over Σ = {a, b, c} that contain at least one occurrence of each symbol?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(a + b + c)* abc (a + b + c)
- 2(a + b + c) a (a + b + c)* b (a + b + c)* c (a + b + c)* + 5 other permutations✓
- 3(a + b + c)* a (a + b + c)* b (a + b + c)* c
- 4a (a + b + c)* b (a + b + c)* c (a + b + c)
Correct answer
(a + b + c) a (a + b + c)* b (a + b + c)* c (a + b + c)* + 5 other permutations
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