Alphabets for following area ∑ = (a, b)

1. Build an FA that accepts only the language of all words with b as the second letter.
2. Build an FA that accepts only the words baa, ab, and abb and no other strings longer or shorter
3. Build a new FA that accepts only the word null.
4. Build an FA with three states that accept all words.
5. Build an FA that accepts only those words that have an even number of letters total.
6. Build an FA that accepts only those words that do not end with ba.
7. Build an FA that accepts only those words that begin or end with a double letter.
8. Build an FA that accepts only those words that have more than four letters.
9. Build an FA that accepts only those words that have fewer than four letters.
10. Design a DFA that accepts all strings that have an even length
but not divisible by 6.
11. Design a DFA that accepts all strings over {a, b} such that the number of as is even and
the number of bs is even.