Let S and T be languages over Σ = {a, b} represented by the regular…
PYQ GATE 2000
Let S and T be languages 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 467 students.
Sign up free to check your answer
Sign up freeLoading lesson…

