• retagged by
6,329 views
2 2 votes

if L1 = { anbncn   | n>= 0 } 

and L2 = { anbmck | k,n,m>=0}

L1 is CSL and L2 is regular.

Now  L3 = L1.(L2)*.

Is L3 is regualar or CSL?

3 Answers

8 8 votes
Regular

L1 = { $\epsilon$, abc, aabbcc, ... }

L2 = a*b*c*

L3 is L1.(L2)*, means $a^nb^nc^n(a^*b^*c^*)^*$

The important thing to notice is that n can be 0. So L3 will be  $(a^*b^*c^*)^*$. Which is regular.
0 0 votes

L1 is CSL

and L2 is regular.

then (L2)* will be reguler (by using closure properties)

and now L1.(L2)*=CSL.Reguler(push up) 

CSL.CSL=CSL

Position:
Show:

Related questions

10 10 votes
2 2 answers
4.1k
4.1k views
Mahesha999 asked Dec 25, 2016
4,145 views
Consider the following statements:$L_1=\left\{\text{wxw$^R$|w$\in$(a,b)$^*$, x$\in$c }\right\}$$L_2=\left\{\text{wy|w, y $\in$ (a,b)$^*$}\right\} $$L_3=\left\{\text{zwz|w...
2 2 votes
1 1 answer
2.4k
2.4k views
rahuljai asked Dec 13, 2018
2,440 views
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n 0 }L = {a^nb^n | n < 1000 }L = {a^nb^k | n is odd or k is even }L = {wxw^R | w,x ∈(0+1)* }1, 3 and...
5 5 votes
1 1 answer
1.7k
1.7k views
Parshu gate asked Nov 16, 2017
1,683 views
Let L={ai bj ck ┤|if j is odd then i=k} where i,j,k>0. Which of the following option is true about L? L is CSL but not CFL L is CFL but not DCFL L is regular L is DCF...
0 0 votes
1 1 answer
2.1k
2.1k views
Xylene asked Jun 15, 2017
2,109 views
Can anyone give me an example of a language which is not a CSL but can be accepted using a Halting TM?