Let S and T be language over Σ = {a, b} represented by the regular expressions…
2000
Let S and T be language over Σ = {a, b} represented by the regular expressions (a + b*)* and (a + b)*, respectively. Which of the following is true?
- A.
S ⊂ T
- B.
T ⊂ S
- C.
S = T
- D.
S ∩ T = ∅
Attempted by 37 students.
Show answer & explanation
Correct answer: C
The regular expression (a + b)* generates all possible strings over the alphabet {a, b}, representing Σ*. Similarly, (a + b*)* generates all strings in Σ* because it includes 'a' and allows any number of 'b's. Thus, both languages S and T are equivalent.
A video solution is available for this question — log in and enroll to watch it.