0 votes 0 votes Samujjal Das asked Dec 23, 2016 Samujjal Das 386 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes a) infinite such no are there to satisty above inequality b) in this option also we have one comparison we need stack so CFL but not regular c) same as above option we need stack for comparison d) this option is regular becaus we have no dependency between m,n,k so it is regular as we can write the regular expression as (a+b)+a+ focus _GATE answered Dec 23, 2016 selected Dec 23, 2016 by Samujjal Das focus _GATE comment Share Follow See all 2 Comments See all 2 2 Comments reply RAJESHWAR YADAV commented Dec 23, 2016 reply Follow Share i think c is regular option D n,m are unbounded and there is repetation of pattern of amb of n times 0 votes 0 votes ankyAS commented Jan 31, 2017 reply Follow Share I have one question about the option c ? would it be regular if {bnam | m>=n and n <=2009}. i think it is regular. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes option c is regular language because n is finite here total 4020 state is required to construct the dfa just replace 2009 by 3 and then construct the dfa it will be easy to understand RAJESHWAR YADAV answered Dec 23, 2016 RAJESHWAR YADAV comment Share Follow See 1 comment See all 1 1 comment reply ankyAS commented Jan 31, 2017 reply Follow Share no i don't think so. when traversing through a how will you know the value of n. I think it will be regular if the power n is first . but in the question the power m comes first. 0 votes 0 votes Please log in or register to add a comment.