2 votes 2 votes What is the Language represented by this given Grammar ? S ---> AS1 S1 ---> aS1b /eps A --->aA /eps Please solve it completely don't write just Answer because it need to know the method . Theory of Computation theory-of-computation grammar + – shekhar chauhan asked Jun 6, 2016 shekhar chauhan 388 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes S1 ---> aS1b -->aaS1bb --> aaaS1bbb-->.............-->anS1bn or S1-->∊ A-->aA -->aaA -->aaaA.............-->anA or A-->∊ Now, S ---> AS1 So Language can be {∊,a,aa,ab,aab,aabb,aaab...................} L={anbm | n>=m} srestha answered Jun 6, 2016 • selected Jun 7, 2016 by Praveen Saini srestha comment Share Follow See all 4 Comments See all 4 4 Comments reply shekhar chauhan commented Jun 7, 2016 reply Follow Share where did you get different power of a and b (like n and m) after telling this ans my related question is if a language is given like this L={a^n b^m} and there is nothing explicitly mention about m and n then how do you consider whether n=m or n<m or n<=m or n>m or n>=m .as you have chosen in above question it is not mention anywhere in grammar . 0 votes 0 votes papesh commented Jun 14, 2016 reply Follow Share It is... Strings to be accepted r... ^, a*, a*b* 0 votes 0 votes ankit commented Sep 1, 2016 reply Follow Share @Gabbar , single 'b'(or b*) will not accept.... (according to ur a*b*) 1 votes 1 votes Pavan Kumar Munnam commented Sep 1, 2016 reply Follow Share It is not type3 ....how are u able to express it in regular expressions 0 votes 0 votes Please log in or register to add a comment.