Assignment 1

1. Construct a DFA that accepts only the empty string.
2. Construct a DFA for the language using alphabet {a, b} for strings having every a preceded by b.
3. Make a transition table for your automaton.
4. Construct a DFA for a language whose strings have an odd number of a's and an even number of b's.
5. Construct a DFA that accepts strings having at least one substring bbb.
6. Make a transition table for your automaton.
7. Construct a DFA that acts as a vending machine for newspapers that cost 25 cents each.
8. Tell what language the following automata recognize.

[pictures will be given in class].