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? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \emptyset$ Theory of Computation tbb-toc-1 regular-expression easy + – Bikram asked Nov 26, 2016 • edited Aug 20, 2019 by Counsellor Bikram 225 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Both the regex represent the same language i.e. set of all strings represented by a and b. Therefore, both are equal. shraddha priya answered Apr 21, 2017 • selected Aug 17, 2019 by Arjun shraddha priya comment Share Follow See all 0 reply Please log in or register to add a comment.