3 3 votes Why (a+b)*.an bn regular? Theory of Computation + – Adiaspirant 809 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 1 1 vote It's a REGULAR language,. If n>=1 or anything it's just a (a+b)* Now, you have choice to take n as any number. Consider every string as a part of (a+b)* and if n>=1 then start string with 'a' and End that string with just 'b' and if n>=0 then it's simply a (a+b)* (Like we do this in palindrome's sums) FA: (a,b)--a-->(a,b)--b-->() For eg. String is bababaabb (bab) a (baab) b smartmeet answered Jan 12, 2017 • selected Nov 6, 2017 by smartmeet smartmeet comment Share Follow See all 2 Comments 2 2 Comments reply Adiaspirant commented Jan 12, 2017 reply Follow flag Even I feel the same but check out this made easy test question http://www.techtud.com/doubt/how-many-following-cfgs-generates-cfl-not-regular 0 0 replyShare smartmeet commented Jan 12, 2017 reply Follow flag Answer edited! 0 0 replyShare Please log in or register to add a comment.