A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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:S = T
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: