We introduced JFLAP as a tool for playing with finite automata. For problems 4-9 below, I encourage you to use JFLAP to create and test your machines.

1. Give a brief English description of the language accepted by
   
2. Give a brief English description of the language accepted by
   
3. Give a brief English description of the language accepted by
   
4. Draw a machine that accepts exactly the strings over alphabet {a,b,c} that start with a and end with c.
5. Draw a machine that accepts exactly the strings over alphabet {a,b,c} of length 1,4,7,10,13,16,19,...
6. Draw a machine that accepts exactly the strings bba, baa and bbc over alphabet {a,b,c}.
7. Draw a machine that accepts everything over alphabet {a,b,c} except the strings bba, baa and bbc.
8. Draw a machine that accepts all strings over the alphabet {a,b,c} that start with b and have odd length.
9. Draw a machine that accepts exactly the strings over alphabet {a,b,c} that start with a and end with c, and which have even length.