
CSC 456/656 Assignment 1
Due date, January 30, 2003, 11:30 AM.
All assignments must be handwritten
(not typed or printed from a computer file)
in your own handwriting, on 8.5 by 11 inch paper. Write your name on
each sheet, and do not fold the pages or crimp the corners.
Turn the pages in to me or to the graduate assistant on the due date.
-
There are two ways of illustrating a FA described in the
textbook, as
a transition diagram or as
a transition table.
For example, Figures 3.2 and 3.3 on page 97 illustrate the same FA in
those two ways.
Consider the transition diagram (d) on page 111.
-
What is the alphabet for that machine?
What is the set of states?
The set of final states?
-
Draw the transition diagram.
-
Find 10 strings that the machine accepts. Find 10 stings over its
alphabet that the machine does not accept.
-
Work exercise 3.1 on page 112 of your textbook.

Back to
Course Page