Syllabus (Word format)

Programming Assignment

Homeworks

1. on Gradiance
2. • on Gradiance
   • JFLAP workbook, Chapter 1, #2 (all parts), #5 (all parts), #6, #7 (part a only)
3. due Sept. 26, 2006
4. due Oct. 3, 2006
5. due Oct. 26, 2006
   • JFLAP workbook, Chapter 5, #1 (all parts), #2 (all parts), #4 (parts a-c), Chapter 6, #1 (all parts), #2 (both parts), #5
6. due Nov. 2, 2006
7. due Nov. 21, 2006
   • JFLAP workbook, Chapter 9, #1 (both parts), #3, #4 (parts a and b)
8. due Dec. 7, 2006

JFLAP information (Java Formal Languages and Automata package -- a tool for drawing and testing various machine models)

JFLAP Turing Machine Examples

• Machine that does integer division by 2
• Machine that does integer division by 3 (a simple modification to the division by 2 machine)
• Machine that does "monus" operation
• Machine that accepts strings of the form wcw, where w consists of 0's and/or 1's (one tape)
• Machine that accepts strings of the form wcw, where w consists of a's and/or b's (two tapes)
• Machine that accepts strings of a group of a's followed by a group of b's, where the group of b's is twice as large as the group of a's
• Alternate version that does not clean the tape for strings not satisfying the format immediately above (courtesy of David Priebel
• Machine that computes the average (possibly truncated) of two numbers in unary form (two tapes)
• Machine that computes the average of two numbers in unary form (by David Priebel and Martha Kosa)
• Turing machine binary adder (by David Priebel)
• Turing machine to convert from binary to unary notation (by David Priebel)