CSC 456/656 Assignment 1
Due date, September 2, 2003, 4:00 PM. Updated August
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.
-
Work Exercise 1.3 on page 84 of your textbook.
-
In Exercise 1.4, for each part, write down the minimum number of
states the DFA accepting the language has, and state whether one of
these must be the dead state.
(For example, (b) requires 4 states none of which is dead,
and (i) requires 3 states, one of which must be the dead state.)
Actually draw the state diagrams for (d) and (f).
-
Let L be the language consisting of all strings over the binary alphabet
{0,1} whose suffix of length 5 begins with 1. (That is, a string w is
in L if and only if the 5th from the last symbol of w is 1.
Thus, 01011001 is in L, while 01001001 is not in L.)
-
Draw a diagram of an NFA with 6 states which accepts L. [CORRECTION]
-
Explain why no DFA with fewer than 32 states can accept L. [CORRECTION]
Hint.
-
A real-life computer could be emulated by a finite state transducer.
(See page 87 of your textbook.) Estimate the
number of states needed for a FST which emulates the PC you have at home
(or your friend's home, if you don't have one).
I really want an informal discussion, rather than a precise number.
Back to
Course Page