0 votes 0 votes Theory of Computation made-easy-test-series theory-of-computation identify-class-language + – vaishali jhalani asked Jan 25, 2017 • edited Mar 5, 2019 by adeebafatima1 vaishali jhalani 341 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L3 is a clear cut CFL but not regular...Refer to anystandard book cfl chapter..it can be done using NPDA and for L4 as there it is written w1 and w2 assuming two different string,it is regular so L4 is regular here Aboveallplayer answered Jan 25, 2017 Aboveallplayer comment Share Follow See all 6 Comments See all 6 6 Comments reply vaishali jhalani commented Jan 26, 2017 reply Follow Share No..in L3 if we take W and Wr as epsilon..then it will become regular. 0 votes 0 votes vaishali jhalani commented Jan 26, 2017 reply Follow Share http://gatecse.in/identify-the-class-of-a-given-language/ 0 votes 0 votes Dhananjay2017 commented Jan 26, 2017 reply Follow Share According to your conclusion, L1 also regular take n=0 i.e; epsilon0epsilon . If single string satisfies property of Regular language doesn't mean than it is RL . Property of RL must satisfy for all the strings generated by language 0 votes 0 votes Sushant Gokhale commented Jan 28, 2017 reply Follow Share L3 is REGEX but not L4 0 votes 0 votes vaishali jhalani commented Jan 28, 2017 reply Follow Share L3 will be reg if we take w as epsilon ? 0 votes 0 votes Sushant Gokhale commented Jan 28, 2017 reply Follow Share yes. 1 votes 1 votes Please log in or register to add a comment.