0 votes 0 votes Which of the following languages are regular 1)L= wwR v : v,w belongs to {a,b}+ 2)L=uwwR v : u,v,w belongs to {a,b}+ 3)L=uwwR v : u,v,w belongs to {a,b}+ .|u| >= |v| Sanjay Sharma asked Apr 26, 2017 Sanjay Sharma 367 views answer comment Share Follow See 1 comment See all 1 1 comment reply Prashant. commented Apr 26, 2017 reply Follow Share L= wwR v : v,w belongs to {a,b}+ Is CFL L=uwwR v : u,v,w belongs to {a,b}+ Is CFL L=uwwR v : u,v,w belongs to {a,b}+ .|u| >= |v| Is CFL 2 votes 2 votes Please log in or register to add a comment.
0 votes 0 votes 6 as minum no it can be [uv]>=n where n=length of string. here u=2 v=3 so minimum is 6 IRSHAD KHAN answered Apr 26, 2017 IRSHAD KHAN comment Share Follow See 1 comment See all 1 1 comment reply Kaluti commented Jun 3, 2017 reply Follow Share (i) not regular cfl (ii) regular (iii) cfl 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 2 is regular language. 3 can't be regular language as we hv to calculate length of u and then compare with length of v, it is not possible as FA does not have memory unlike PDA. 1 is also not regular as it involved comparison in w. AnilGoudar answered Jun 3, 2017 AnilGoudar comment Share Follow See all 0 reply Please log in or register to add a comment.