CS 3350, Spring 2020, Assignment 1 (Due January 22)

Write a finite automaton that accepts the set of strings over {a,b} that begin with a and end with a.
Example of accepted strings: a, aa, aaa, aba, aaaa, aaba, ...
Example of rejected strings: empty string, b, ab, ba, aab, abb, baa, ...