in Theory of Computation
759 views
0 votes
0 votes
Hi Mates,

Is it true or false..?

The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a+b)*..?

Please answere with explanation.

Thanks
in Theory of Computation
759 views

1 comment

L={VUV | V,U $\epsilon (a,b)^{*}$ }

consider V=$\epsilon$ and U=$(a+b)^{*}$  then it is complete language.

So L=$(a+b)^{*}$.
0
0

1 Answer

0 votes
0 votes
For any string x∈{a,b}*, we can treat it as x=ϵxϵ, where v=ϵ,x=u. Therefore, any string x∈{a,b}* is in L. Thus, L = (a + b)*
by