Extra-Credit                    Due:   8/10/2016
 
Homework-E2,         Student Name:

 2.1   Write the regular expression for the following NFA:

                             

2.2. Draw a DFA that accepts all strings made from the alphabet {a, b } except bba . That is, this DFA does not accept bba ; it accepts all other strings from (a+b)*

 2.3   Give (or describe)  a language that cannot be processed (accepted)  by any  NFA.  
      Explain why there cannot be an NFA that would accept it.  















2.4   Build a model of  certain aspects of phenomena that have states.  You may like to 
    use FA or NFA (or Transition Graphs )for modeling the phenomena.
    Add any  explanations that may clarify issues.