Practice Written Assignment 14
CS 3511 Fall Semester, 2006
47 Points
Topics: Finite-State Machines, Language Recognition
Turing Machines
Reading assignment:
Sections 12.3, 12.4, and 12.5 of Chapter 12
( = Sections 11.3, 11.4, and 11.5 of Chapter 11 5th Edition)
Written assignment (Note: these exercises are all from the
5th Edition):
- (4 points) Exercise 4, parts d, e of Section 11.1 page 749
- (2 points) Exercise 12, part b of Section 11.1 page 749
- (4 points) Exercise 22 of Section 11.1 page 750
- (2 points) Exercise 19 of Section 11.3 page 765
- (4 points) Exercise 27, parts b, c of Section 11.3 page 765
Hint: a "dead" state (a non-final state with transitions only to itself)
will be useful.
- (3 points) Exercise 7, part b of Section 11.4 page 774
- (3 points) Exercise 16, of Section 11.4 page 775
- (3 points) Exercise 19, of Section 11.4 page 775
- (4 points) Exercise 1, of Section 11.5 page 782
- (3 points) Exercise 3, of Section 11.5 page 782
- (5 points) Exercise 5, of Section 11.5 page 782
- (5 points) Exercise 9, of Section 11.5 page 782
- (5 points) Exercise 11, of Section 11.5 page 782
Page URL: http://www.d.umn.edu
/~ddunham/cs3511f06/assignments/a16/assignment.html
Page Author: Doug Dunham
Last Modified: Thursday, 14-Dec-2006 09:10:33 CST
Comments to: ddunham@d.umn.edu