Due Dates: Oral presentations of material begin on 6 September.

Written descriptions of material presented due one week after presentation.

**Topics:** Nondeterminism (Chapter 1).

An integral part of this class is understanding and presenting the problems
assigned as homework. Everyone is expected to do all the problems,
but we will take turns on who presents the problem solutions to the class
(every 2-3 weeks, depending on the number of students in the class). Within
a week of presenting a problem solution to the class, you must submit a written
description of it, via the Blackboard system. The written solutions
will be posted on the Blackboard website for the class, so, they can used
by everyone to study for the exams. Since it's hard to write
down answers that are concise and are easily readable by all, if you wish
to improve a grade on any problem, you may resubmit it for grading.

## Undergraduate Problems

All students enrolled should complete the following:

- Give a state diagram of a NFA that recognizes the following language:

{w | w ends with 00} and has 3 states

(assume that the alphabet is {0,1}).
- Give a state diagram of a NFA that recognizes the following language:

{w | w ends with 11} and has 3 states

(assume that the alphabet is {0,1}).
- Give a state diagram of a NFA that recognizes the following language:

{w | w ends with 00 or w ends with 11}

(assume that the alphabet is {0,1}).

Hint: combine the answers to the #1 and #2.
- Give a state diagram of a NFA that recognizes the following language:

{0} and has 2 states

(assume that the alphabet is {0,1}).
- Give a state diagram of a NFA that recognizes the following language:

{w | w contains only 0's} and has 1 state

(assume that the alphabet is {0,1}).

## Graduate Problems

Students enrolled for graduate credit, should complete all the undergraduate problems, as well as:

- Give a state diagram of a NFA that recognizes the following language:

{w | w is any number of 0's, followed by any number of 1's} and has 3 state

(assume that the alphabet is {0,1}).
- Give a state diagram of a NFA that recognizes the following language:

{w | w contains only 0's or contains only 1's} and has 4 state

(assume that the alphabet is {0,1}).
- Show that every NFA can be converted to one with a single accept state.