The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
64 views

asked in Theory of Computation by Active (3.6k points) | 64 views

1 Answer

0 votes
Best answer

Answer : B

1. False.  $L(E)$ $\neq (a+b+c)^*$.. For instance, the String $ba$ can not be produced by the Regular expression.

2. True.  $L(EE)$ = $(a + b + c)^*$.. Try it once.. It's a beautiful question. 

3. False. $(L(E))^*$ = $(a + b + c)^*$.... Because we can see that $a,b,c \in L(E)$.. Hence, $(L(E))^* = (a+b+c)^*$.. But from Statement $1$, we already know that  $L(E)$ $\neq (a+b+c)^*$.. Hence, $L(E) \neq (L(E))^*$

4. True. We just saw that $(L(E))^* = (a+b+c)^*$ and from statement $2$ we know that $L(EE)$ = $(a + b + c)^*$...
Hence, $L(EE) = (L(E))^*$

answered by Boss (18.7k points)
selected by


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

40,851 questions
47,514 answers
145,843 comments
62,274 users