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? Theory of Computation theory-of-computation context-sensitive regular-language + – AnilGoudar 6.3k views answer comment Share Follow Print See all 17 Comments 17 17 Comments reply srestha commented May 10, 2017 reply Follow flag how L2 could be regular? 0 0 replyShare Purvi Agrawal commented May 10, 2017 reply Follow flag L2 should be dcfl ? 0 0 replyShare srestha commented May 10, 2017 reply Follow flag @Purvi of course it is DCFL 0 0 replyShare Purvi Agrawal commented May 10, 2017 reply Follow flag Then what should be the answer mam ? 0 0 replyShare srestha commented May 10, 2017 reply Follow flag See this closure propertieshttp://gatecse.in/closure-property-of-language-families/ Now, L2 is DCFL. But DCFL not closed under kleen star. So, L2 may or may not be DCFL. Now, L1.(L2)* = it is a concatenation operation. And, CSL closed under concatenation . So, result will be CSL 1 1 replyShare AnilGoudar commented May 10, 2017 reply Follow flag Edited the question.. Sorry for my mistake 0 0 replyShare Purvi Agrawal commented May 10, 2017 reply Follow flag Mam if dcfl does not satisfy closure property then we will look for cfl or csl and how do we decide ? I thought we see the language just of the higher type..why are we not considering cfl ? 0 0 replyShare srestha commented May 11, 2017 reply Follow flag yes.. 0 0 replyShare Akriti sood commented May 11, 2017 reply Follow flag @srestha,after concatenation,does'nt the language become regular?? 0 0 replyShare Akriti sood commented May 11, 2017 reply Follow flag sorry..my mistake..:-)it will not be regular 0 0 replyShare srestha commented May 11, 2017 reply Follow flag Akriti, question edited here :) 0 0 replyShare Akriti sood commented May 11, 2017 reply Follow flag tell me one thing,if it was not a keen closure then would L3 be regular? i mean like this L3 =L1XL2 CROSS PEODUCT instead of concatenation 0 0 replyShare AnilGoudar commented May 11, 2017 reply Follow flag It's I think L3 is regular 0 0 replyShare srestha commented May 11, 2017 reply Follow flag @Akriti how do u find cross product in TOC? It is only in DBMS. symbols are different in each subject :) 0 0 replyShare Purvi Agrawal commented May 11, 2017 reply Follow flag Yes there exists concatenation but no cross product in toc 0 0 replyShare Akriti sood commented May 11, 2017 reply Follow flag so sorry,i mixed them..:-P 0 0 replyShare arun yadav commented Oct 4, 2020 reply Follow flag Is L2 is regular? 0 0 replyShare Please log in or register to add a comment.
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. Dhruv Patel answered May 11, 2017 Dhruv Patel comment Share Follow See all 8 Comments 8 8 Comments reply Show 5 previous comments Dhruv Patel commented May 11, 2017 reply Follow flag @Archies09 Oh I see it now. Sorry. They are same :) 0 0 replyShare Harsh181996 commented May 15, 2017 reply Follow flag So , shouldn't the answer be both ? Every Regular Language is a CSL right. 1 1 replyShare Dhruv Patel commented May 15, 2017 reply Follow flag @Harsh That's correct. Every regular language is CSL. So both are correct. Though regular language answer is more specific. 0 0 replyShare Please log in or register to add a comment.
2 2 votes R1(R2)* is simply (a+b+c)*....and hence regular joshi_nitish answered May 15, 2017 joshi_nitish comment Share Follow 0 reply Please log in or register to add a comment.
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 pawan kumarln answered May 11, 2017 pawan kumarln comment Share Follow See 1 comment 1 1 comment reply Gatecoder commented May 12, 2017 reply Follow flag correct i have also same explanation.. 0 0 replyShare Please log in or register to add a comment.