1 1 vote What is one of the Grammar represented by this Language ? L = {a^n b^n+1 where n>=0} Give an Example for this. Theory of Computation theory-of-computation grammar + – shekhar chauhan 1.4k views answer comment Share Follow Print See 1 comment 1 1 comment reply ManojK commented Jun 7, 2016 reply Follow flag it should be an bn+1 right ? 1 1 replyShare Please log in or register to add a comment.
Best answer 2 2 votes Given language is L={an bn+1 |n≥0} . Strings in the language is { b ,abb,aabbb ,........................} So CFG for above grammar will be S→aSb | b ManojK answered Jun 7, 2016 • selected Jun 7, 2016 by shekhar chauhan ManojK comment Share Follow See all 6 Comments 6 6 Comments reply Show 3 previous comments ManojK commented Jun 7, 2016 reply Follow flag o a,s followed by 0+1 b,s 1 1 replyShare shekhar chauhan commented Jun 7, 2016 i reshown by shekhar chauhan Jun 7, 2016 reply Follow flag Hi Manoj k srestha solution is wrong Right ? 0 0 replyShare ManojK commented Jun 7, 2016 reply Follow flag He is not getting the question properly.So no comment . 0 0 replyShare Please log in or register to add a comment.
0 0 votes Cannot getting the question properly L=((anbn)+)! L=(anbn).(an-1.bn-1).(an-2bn-2)............a2b2.ab each of then can be represent by a CFL Like for {anbn} S->aSb|ab srestha answered Jun 6, 2016 srestha comment Share Follow See 1 comment 1 1 comment reply shekhar chauhan commented Jun 7, 2016 reply Follow flag this grammar is representing a^n b^n but not a^n b^n+1 i asked for a^n b^n+1 0 0 replyShare Please log in or register to add a comment.
