GATE | GATE-CS-2000 | Question 4

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 = φ


Answer: (C)

Explanation: Both have same output because if we draw DFA of S which is (a+b*)*, at final state it is just repeating.

Quiz of this Question

My Personal Notes arrow_drop_up

Save