Name: ____________________________________________________ Alpha: _____________________

Describe help received: _________________________________________________________________

## Problem 1

Prove the following theorem.

**Theorem**
For any *k > 0* and alphabet Σ, the language
of all strings over Σ of length *k* is
accepted by a nondeterministic finite automaton.

**Note 1**: I'm asking for a full proof here. That
means you have to provide the whole algorithm, not just the
specification!

**Note 2**: This should be

*simple*. Don't
make it tricky, and make sure it's short and sweet.