So i'm taking this class automata and complexity at georgia tech and we were given practice material for our exam.
one of the question is to give context free grammar for these two languages
and the answers are:
I can understand these and verify that these are indeed correct once I know the solution, but I'm finding it incredibly hard to even come close to coming up with them.
Does anyone have any advice on how to intuitively come up with CFGs