Hey I really need help on these questions for an assignment that is due day after tomorrow. Please help me out because I have no clue how to do these questions.

  • Let S = {0,1,l}. Create a regular grammar that generates each of the following languages.

a) L = {(01)n | n >=1} b) L = {001n00| n>=2)