This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 The answers in this item are from the Instructor Manual for Linzs textbook. Page 1 of 2 CS 314 Day 11: February 26, 2008, Version 1.0 Item #15. Homework assignments up to Spring Recess. Assigned Day 10 for Day 11: Read 4.1, 2 and do 4.1(2a, 5, 6, 17) What does it mean to have a problem assigned whose answer is in the back of the book? As I said in a Feb. 22 email, it means that you should try it, then compare your answer with the back of the book, and finally use that answer to improve your answer. In particular for 4.1(2a), you are being asked to use the construction of Theorem 4.1, so I expect that you will describe the transition function of the Theorem in terms of * 1 and * 2 of the theorem. Assigned Day 11 for Day 12: No written homework for 4.2. Study for the midterm exam, which covers through this section. Item # 16 below contains answers to the 4.2 exercises not in the text that are at the level that I would like to have you understand this section. Assigned for Day 12: Study for a midterm Exam through 4.2. Assigned for Day 13: Read 4.3. Its hard! We will do a lab on it in class on Day 13, and our homework assignment for 4.3 will be a team assignment. Item #16. Solutions for exercises 18, 1315 in 4.2. 1 As much as possible in this section, use set operations together with known algorithms. 3. Because L is regular, a dfa (Q, G , * , q , F) can be constructed for it, regardless of whether the language is given by a dfa, by an ndfa, by a rightlinear grammar, or by a regex. language is given by a dfa, by an ndfa, by a rightlinear grammar, or by a regex....
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