0 votes 0 votes Theory of Computation theory-of-computation regular-language + – Ayush Upadhyaya asked Mar 15, 2017 retagged Jun 4, 2017 by Arjun Ayush Upadhyaya 231 views answer comment Share Follow See 1 comment See all 1 1 comment reply Akriti sood commented Mar 15, 2017 reply Follow Share (a) regular as we can write { n>1,l>1,k>1} (b) as there is a comparison l <=k,hence it is not regular. (c) n/l is an integer if n is divisible by l,i.e n is a multiple of l,which i think cannot be made by a regular language. (d) n+ l is a prime which is again not regular. (e)l <= 2n,which is a comparison,hence,again not regular. (f) it is a regular language. (g) for this we need n to be l+2 or l to be n+2,which is not possible with regular language. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes This question is already answered for reference check below link https://gateoverflow.in/?qa=blob&qa_blobid=3726082460590158103 Deepthi_ts answered Apr 11, 2017 Deepthi_ts comment Share Follow See all 0 reply Please log in or register to add a comment.