in Theory of Computation edited by
75 views
0 votes
0 votes

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?

  1. $S \subset T$
  2. $T \subset S$
  3. $S = T$
  4. $S \cap T = \emptyset$
in Theory of Computation edited by
by
75 views

1 Answer

1 vote
1 vote
Best answer
Both the regex represent the same language i.e. set of all strings represented by a and b. Therefore, both are equal.
selected by
Answer:

Related questions