CS 3350 Automata, Computability, and Formal Languages
Fall 2018, Quiz 1

Last 4 digits of your UTEP ID number: ____________________________

1. Use a general algorithm to design a regular expression corresponding to the following finite automaton. This automaton has 2 states:

The transitions are as follows: Start by eliminating the odd state.