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)ScT (S is a subset of T)
B)TcS (T is a subset of S)
C)S=T
D)SnT=Ø

Name: 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)ScT (S is a subset of T) B)TcS (T is a subset of S) C)S=T D)SnT=Ø
Brand: Quizplus
Rating: 4.9 (36 reviews)

Question

Quizplus · Accepted Answer

S and T both represent the set of all strings over {a,b}.

Let S and T Be Language Over ={A,b} Represented by the Regular