## 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 state "even (e) which is both a
starting state and a final state, and
- the state "odd"
(o).

The transitions are as follows: - from e, any
digit (0 or 1) leads to o;
- from o, any digit (0 or 1) leads
to e.

Start by eliminating the odd state.