Last modified:

**Assigned:** Fri 01-14-11

**Due:** Fri 01-21-11

- Please review the grading policy 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 followingProblem 01 02 03 04 05 06 07 08 09 ... Credit RC RC RC EC RC RC NA RC RC ... 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 penalty assessment.

- 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.4, parts a, f; Exercise 1.5, parts d, f
- Exercise 1.6, parts a, b, c, d, e
- Exercise 1.6, parts f, g, h, i, j
- Exercise 1.6, parts 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
*S*_{2}be the alphabet described in Problem 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 final column.

Harriet Fell

College of Computer Science, Northeastern University

360 Huntington Avenue #340 WVH,

Boston, MA 02115

Phone: (617) 373-2198 / Fax: (617) 373-5121

The URL for this document is: http://www.ccs.neu.edu/home/fell/CS3800/SP11/hw.01.html