Assignment 4 -- Due 2 p.m. Monday, February 18
at the beginning of class
CS 4511 Spring Semester, 2008
30 Points
Topics: Regular languages, finite automata, nondeterminism, regular
expressions, nonregular languages
Reading: Chapter 1 Regular Languages
The assignment:
- (6 points) Exercise 1.16 part (b) only; page 86
- (6 points) Exercise 1.21 part (a) only - eliminate state 1 then 2;
page 86
- (6 points) Exercise 1.22 (both parts); page 87
- (6 points) Exercise 1.28 part a. only; page 88
- (6 points) Exercise 1.29 parts a. and b. (hint: the third condition
of the Pumping Lemma makes part b. easier [and part a. for that matter]);
page 88
Page URL: http://www.d.umn.edu
/~ddunham/cs4511s08/assignments/a4/assignment.html
Page Author: Doug Dunham
Last Modified: Monday, 11-Feb-2008 12:26:47 CST
Comments to: ddunham@d.umn.edu