Test by Bikram | Theory of Computation | Test 1 | Question: 27

Question

If $S$ and $T$ are languages over $\Sigma =\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$ respectively, then which of the following options is CORRECT?

• A. $S \subset T$
• B. $T \subset S$
• C. $S = T$
• D. $S \cap T = \emptyset$

Answer 1

Both the regex represent the same language i.e. set of all strings represented by a and b. Therefore, both are equal.