Unformatted text preview: CS314 Day 14: March 6, 2008, Version 3.0 Item #18. Homework assignments for week after Spring Recess. Day 15, March 18: Section 5.1, Exercises 2, 3, 5, 7b, 8c, and 22. [7b was not assigned in earlier versions] I did not lecture on this very easy material. But see comments in the midterm exam postmortem, which I extended to include some helps for this section. Day 16, March 20: Prove (not show) that the following five languages in JFLAP’s Pumping Lemma for Regular Languages section are regular if they are regular, or are not regular if they are not regular: ## 2, 4, 5, 7, 9 (I am assuming that the 13 problems in that JFLAP section are numbered 113. We did ## 1, 3, and 13 in class lab today.) Hint: Exactly one of the languages is in fact regular. This is a team assignment. One report should be turned in per team. ## 2 and 4 are in the text as Examples 4.9 and 4.10, so they should be easy. #5 is in the text but not as an application of the Pumping Lemma. You should do it with the Pumping Lemma in JFLAP. not as an application of the Pumping Lemma....
View
Full
Document
This note was uploaded on 04/19/2008 for the course COMP 314 taught by Professor Chase during the Spring '08 term at Dickinson.
 Spring '08
 CHASE
 Computer Science

Click to edit the document details