2 2 votes Theory of Computation + – iita 3.2k views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply Show 3 previous comments iita commented Feb 4, 2017 reply Follow flag my doubt is why can't L3 be regular as 0 ϵ (a,b)* so it is of the form WxWR which is regular...correct me if I am wrong 0 0 replyShare saurabh rai commented Feb 4, 2017 reply Follow flag where it is given 0 ϵ (a,b)* ?? 0 0 replyShare iita commented Feb 4, 2017 reply Follow flag look in L3 it's given that 0,W ϵ (a,b)*. ..... 0 0 replyShare Please log in or register to add a comment.
1 1 vote L1,L2,L3 is CFL only L4 is regular Ritesh Singh answered Feb 4, 2017 Ritesh Singh comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes L1 DCFL L2 DCFL L3 DCFL L4 REGULAR **AFTER CORRECTIONS Smriti012 answered Feb 4, 2017 • edited Feb 4, 2017 by Smriti012 Smriti012 comment Share Follow See all 7 Comments 7 7 Comments reply Show 4 previous comments Smriti012 commented Feb 5, 2017 reply Follow flag WxWR | w,x ϵ (a,b)* this is regular language (true) whereas W0WR | 0 could not ϵ (a,b)* ,w ϵ (a,b)* with alphabet set a,b,0 ...so this is CFL example : WxWR | w,x ϵ (0,1)* this is regular language { 1(0+1)* 1 + 0(0+1)* 0 : regular expression} whereas W2WR | 2 ,w ϵ (0,1)* with alphabet set 0,1,2............... if this is regular write regular expression for this!?????? As per my knowledge, its impossible to use alphabet 2 in string formed over w ϵ (0,1)* What u are talking about will be definately true if alphabet sent wouldn't contain 0 (in given question). We can't use one alphabet of alphabet set to define language over other set of alphabet,i.e. we can't use 0 of alphabet set to define language over a&b set of alphabet, 1 1 replyShare Jason_Roy commented Feb 5, 2017 i edited by Jason_Roy Feb 5, 2017 reply Follow flag OK!! 0 0 replyShare iita commented Feb 5, 2017 reply Follow flag yah got it @smriti012 thanks buddy 0 0 replyShare Please log in or register to add a comment.
