Created: Wed 16 Sep 2009
Wed 16 Sep 2009
Wed 23 Sep 2009
- Please review the
outlined in the course information page.
- On the first page of your solution write-up,
you must make explicit which problems are to be graded for
"regular credit", which problems are to be graded for "extra credit",
and which problems you did not attempt.
Please use a table something like the following
where "RC" is "regular credit", "EC" is "extra credit", and "NA"
is "not applicable" (not attempted). Failure to do so will result
in an arbitrary set of problems being graded for regular
credit, no problems being graded for extra credit, and a five percent
- You must also write down with whom you worked on the assignment. If this
changes from problem to problem, then you should write down this
information separately with each problem.
Required: 5 of the following 6 problems
Points: 20 pts per problem
- Exercise 1.6, parts a, b, c, d, e
- Exercise 1.6, parts f, g, h, i
- Exercise 1.6, parts j, k, l, m, n
- Exercise 1.24; Exercise 1.27
- Read the informal definition of the finite state transducer
given in Exercise 1.24.
Let S2 be the alphabet
described in Exercise 1.33. Construct an FST which outputs
the binary sum of the two rows of bits. You may assume,
for convenience, that the string is ordered starting with
the least signigicant bit, and you may ignore any carry out of the
- Exercise 1.3
- Give the formal descriptions of the machines pictured in Exercise 1.21,
(a) and (b).