Lec22FEReview - COT 4210 Final Exam Information Date:...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
COT 4210 Final Exam Information Date: 4/27/05, Wednesday Time: 1-4pm Room: ENG2-203 Permitted Test Aids: 6 sheets of notes on 8.5"x11" paper; both sides on each page Outline of Exam Material Book Reading: Chapters 1-4, Sections 5.1, 5.3, Chapter 7 Sections from Sudkamp: 4.3-4.6, 5.5-5.6, 6.7 I. Regular Languages A. DFAs B. NFAs C. REs D. DFA Minimization Algorithm E. Pumping Lemma for Regular Languages II. Context-Free Languages A. Context-Free Grammars B. Parsing C. Greibach Normal Form D. PDAs E. Pumping Lemma for Context-Free Languages III. Church-Turing Thesis A. Turing Machines B. Turing Machine Variants C. Definition of Algorithms IV. Decidability A. Decidable Languages B. The Halting Problem V. Reducibility A. Undecidable Problems B. Mapping Reducibility VI. Time Complexity A. Measuring Complexity B. The Class P C. The Class NP D. NP-Completeness E. Additional NP-Complete Problems
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
I. Regular Languages A. DFAs Formal Definition, How to design (conceptual idea of states), acceptance
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

Lec22FEReview - COT 4210 Final Exam Information Date:...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online