GATE 1998
March 18, 2025GATE 2000
March 18, 2025GATE 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?
|
S ⊂ T
|
|
|
T ⊂ S
|
|
|
S = T
|
|
|
S ∩ T = ɸ
|
Question 4 Explanation:
If we draw DFA for language S and T it will represent same.
Correct Answer: C
Question 4 Explanation:
If we draw DFA for language S and T it will represent same.