1

Taken from Sipser, 2.28.

I came up with the following:

$$S \rightarrow \epsilon|aS|bAs$$ $$A \rightarrow a|bAA$$

I believe this grammar generates the mentioned language, but I am not sure how to check that it does so unambiguously. Any hints?

mmmmo
  • 590
  • What are some strings of the language? I do not understand "At least". If there are as many $a$'s as $b$'s then there cannot be more $a$'s than $b$'s or viceversa. – manooooh Nov 07 '19 at 20:44
  • 1
    for example aab, ab, a, aaababa, etc. The number of a's in the string is equal or more than the number of b's – mmmmo Nov 07 '19 at 21:20

0 Answers0