Extra-Credit  
 Homework-E1, Due  08/08/2016     Student Name:

1.1  Write a regular expression for each of the following Non-Deterministic 
     Finite Automata (NFA): 

 
    
 

   


1.2.   Build an FA  that accepts the regular expression:    b*ab









                                     

1.3  Build an FA (or NFA) that accepts only the words   baa,  ab  and abb
     and no other strings longer or shorter.

 








  


1.4  Build an FA  that accepts      ab*ab*a

 









1.5  Build an NFA for  (a+b)*ab