Name: ____________________________________________________ Alpha: _____________________

Describe help received: _________________________________________________________________

## Problem 1

Using JFLAP, produce a machine that accepts the language
of all strings over the alphabet

*{a,b,c}* that end
in

*cc*. Turn in a printout, and test it to

**make
sure it works!**

## Problem 2

Give a concise English description of the language
defined by the machine

*M1*:

**M1:**

## Problem 3

Give a concise English description of the language
defined by the machine

*M2*:

**M2:**

## Problem 4

Draw a machine that accepts the intersection of the
languages accepted by

*M1* and

*M2*.
Use the method we went over in class, which is
demonstrated by (2) in the lecture notes.
(You might want to do this on a separate piece of paper!)

## Problem 5

Give a brief justification for the following assertion:
For any two finite automata *M1* and *M2*
there is a finite automaton *M'* that accepts the
language
*L(M1)* union *L(M2)*, i.e. the language of
strings that are accepted by either *M1*,
*M2* or both.