a) Give an example of a string of length 6 containing 01 that is accepted by the following automaton.

b) Give an example of a string of length 5 that is rejected by the following automaton.

c) Describe the language of this automaton in terms of a Regular Expression.

d) Re-draw this FSA with at most 4 states. The new FSA should accept all strings that this FSA accepts. In addition, it should reject all strings that this FSA rejects.

e) Draw a FSA which accepts all binary strings which start with 0, the length of the string is even but the number of 1s in the string is odd. For example, 0111, 01 and 000111 should be accepted while 111 and 0011 should not.