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?

  1. A.

    S ⊂ T

  2. B.

    T ⊂ S

  3. C.

    S = T

  4. D.

    S ∩ T = ∅

Attempted by 467 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…