0 votes 0 votes https://gateoverflow.in/?qa=blob&qa_blobid=9622019941645658924 please some one explain this?? Theory of Computation made-easy-test-series theory-of-computation regular-language + – aaru14 asked Nov 18, 2017 edited Mar 4, 2019 by adeebafatima1 aaru14 280 views answer comment Share Follow See 1 comment See all 1 1 comment reply abhishek tiwary commented Nov 18, 2017 reply Follow Share if we will take the complement of L3 it will be regular and regular is closure under complement 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes L1 = {a1^1 , a2^2, a3^3............} ={a1,a4,a9 ...... } which is not in AP {Arithmetic progression} L2 = {a1^1, a4^2, a9^3..........} not in AP. L3 ={a2^1, a3^1, a4^1.........} put n=1 and m>n regular expression for L3= {aa+} hence, L3 is regular. Akash Mittal answered Nov 18, 2017 Akash Mittal comment Share Follow See all 2 Comments See all 2 2 Comments reply aaru14 commented Nov 18, 2017 reply Follow Share but in L3 if we change value of n in every term then it is not in AP. why u put n=1 in every term 0 votes 0 votes Akash Mittal commented Nov 18, 2017 reply Follow Share because {aa+} will generate all lang. 0 votes 0 votes Please log in or register to add a comment.