1 votes 1 votes Give a verbal description of the language generated by the productions: S → aSb S → bSa S → aa Theory of Computation theory-of-computation peter-linz peter-linz-edition4 grammar + – Garrett McClure asked Aug 31, 2017 edited Mar 5, 2019 by Naveen Kumar 3 Garrett McClure 755 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes L= { w | na(w) = nb(w) +2} } where na(w)= no of occurrence of 'a' and nb(w)= no of occurrence of 'b' language will accept all the string where no of 'a' will be 2 more than the no of 'b'. Satyajeet Singh answered Sep 1, 2017 selected Sep 1, 2017 by Garrett McClure Satyajeet Singh comment Share Follow See all 2 Comments See all 2 2 Comments reply hs_yadav commented Sep 1, 2017 i edited by hs_yadav Sep 1, 2017 reply Follow Share @ Satyajeet Singh string 'aab' not accepted by the language..... {na(w) = nb(w) +2} 1 votes 1 votes Satyajeet Singh commented Sep 1, 2017 reply Follow Share thank you @hs-yadav . 0 votes 0 votes Please log in or register to add a comment.