0 votes 0 votes Which of the following is Regular? Theory of Computation theory-of-computation regular-language made-easy-test-series + – Gupta731 asked Nov 4, 2018 edited Mar 3, 2019 by Aditi Singh Gupta731 1.1k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Soumya Tiwari commented Nov 4, 2018 reply Follow Share S1 is string with any number of a's as you can represent any string of a in term of (a^n)^m where m is greater or equal than n. 0 votes 0 votes Ram Swaroop commented Dec 22, 2018 reply Follow Share How 2nd regular 0 votes 0 votes Shiva Sagar Rao commented Apr 27, 2021 reply Follow Share https://gateoverflow.in/313020/madeeasy-test-series-theory-computation-regular-languages 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes S1. (a^n)^m can be written as (x)^m , m>=0 , which is regular. S2. {a^nb^n / n>=1} it is CFL U {a^nb^m /n,m>=1} - it is regular. So CFL U REG = REG and if it is regular then it will be CFL also. Dharmendra Verma answered Nov 4, 2018 Dharmendra Verma comment Share Follow See all 3 Comments See all 3 3 Comments reply Gupta731 commented Nov 4, 2018 reply Follow Share yeah, got it thanks 0 votes 0 votes Dhillu Thambi commented Nov 6, 2018 reply Follow Share Explanation of the second one is not correct I guess. For CFL and DCFL union with Regular language is closed. CFL U RL = CFL 0 votes 0 votes Gupta731 commented Nov 6, 2018 reply Follow Share @Dhillu Yes correct 0 votes 0 votes Please log in or register to add a comment.