Automata Grmmar Language

Question

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 .

Answer 1

S1 ---> aS1b -->aaS1bb --> aaaS1bbb-->.............-->aⁿS1bⁿ or S1-->∊

A-->aA -->aaA -->aaaA.............-->aⁿA or A-->∊

Now, S ---> AS1

So Language can be {∊,a,aa,ab,aab,aabb,aaab...................}

L={aⁿb^m | n>=m}

Comments

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 .

---

It is...

Strings to be accepted r...

^, a*, a*b*

---

@Gabbar , single 'b'(or b*) will not accept.... (according to ur a*b*)

---

It is not type3 ....how are u able to express it in regular expressions