Extr-Credit
Assignment-E3        Student Name:

  3.1  Write the regular expression for the following  NFA:   


 



  3.2  Write a CFG  for  L2   =    { anc*bn : where n > 0     OR   n = 0  (i.e.  n >= 0) } 
    






  3.3  Write a CFG  for  L3   =    { b*anc*bn : where   n >  0  } 
    





  3.4  Write a CFG  for   L4 =  { d*anc*bna* : n > 0  } 
    






  3.5.  Develop a program using a programming language of your choice that takes  
    an input string and accepts it if the string belongs to the following set:

   acb* =  { ac,   acb,   acbb,   acbbb, acbbbb,  acbbbbb,  acbbbbbb, . . .   }

  otherwise, the string is rejected.  Build a model such as an  NFA for this problem.