COS 550 F08 HW #8 DUE Thursday 11/13/08
Problem 1 - see below,  35 points
p.240 Problem  1,       35 points
p.246 Problem  1,       10 points
p.247 Problem  3,       10 points
p.252 Problem  3,       10 points
********** Problem Notes *********,
Problem 1
You should write a FSA simulator. You may use any reasonable language and 
any reasonable way of entering an FSA into the simulator. It should have 
the ability to read an FSA description from a file. As usual, I expect to 
see comments and good code.

p. 240 Problem 1
As you might expect, give a solution and then run some sample cases on 
your FSA simulator for all problems except 1 (f). For 1 (f) you can give a 
solution using any finite number of states, and you can describe the 
states and not give the graph if you have too many states. For the other 
cases you must provide the state transition graph and simulate the FSA. 
For 1 (e) you can use the alphabet 0, 1, 2, 3,...,7 treating each of the 
column vector as a binary number where you read it from top to bottom. For 
example 0 corresponds to 011 or 3.
        1
        1

p.246 Problem 1 and p. 247 Problem 3
You do not have to simulate the machines in these problems.