Register

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

• edited by
221 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$
• edited by
User Avatar

1 Answer

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.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

6 votes
6 votes
2 answers
1
Bikram asked Nov 26, 2016
1,233 views
Test by Bikram | Theory of Computation | Test 1 | Question: 30
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is: Decidable Undecidable but semi-decidable Not even semi-decidable Indeterminable
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is:DecidableUndecidable but semi-decida...
User Avatar
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
315 views
Test by Bikram | Theory of Computation | Test 1 | Question: 29
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an: Decidable problem Undecidable problem Cannot ascertain None
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an:Decidable prob...
User Avatar
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
225 views
Test by Bikram | Theory of Computation | Test 1 | Question: 28
Recursive Enumerable Languages are NOT closed under : Union Intersection Complement Homomorphism
Recursive Enumerable Languages are NOT closed under :UnionIntersectionComplementHomomorphism
User Avatar
1 votes
1 votes
1 answer
4
Bikram asked Nov 26, 2016
699 views
Test by Bikram | Theory of Computation | Test 1 | Question: 26
$L1$ and $L2$ are regular languages. $L3$ is CFL and $L4$ is a recursive enumerable language. $L5$ is the reversal of $L4$. If $L6= \{ (L3/y)$ intersection $L5 \}$ where $y$ is input alphabet, then $L6$ is a: Regular Language CFL Recursive Enumerable Language Non Recursive Enumerable Language
$L1$ and $L2$ are regular languages. $L3$ is CFL and $L4$ is a recursive enumerable language. $L5$ is the reversal of $L4$.If $L6= \{ (L3/y)$ intersection $L5 \}$ where $...
User Avatar
Link Copied!