Final Review    CSCI 339

  1. Context Free, Context Sensitive, and General Grammars
  2. CYK algorithm for parsing a string in a grammar
  3. Turing Machines and PDA's
  4. Pumping Lemma and/or Ogden's Lemma for Context Free Languages
  5. Intersection of Context-sensitive and Regular languages is regular
  6. Unions, Intersections, and Complements for Regular, Context-Free, Recursive, and Recursively Enumerable languages
  7. Non-computable problems

Example Problems

  1. Find all parses for a string in a grammar using the CYK algorithm.
  2. Construct a TM to solve a problem or recognize a language.
  3. Prove a given problem is not computable by reducing the problem to one of the known non-computable problems.
  4. Prove a given language is or is not Context Free.
  5. Construct a grammar to generate a given language.
  6. Construct a PDA to recognize a language.

Composition of the Final

AT LEAST 60% of the Final will be material covered since the midterm or not covered on the midterm. I do reserve the possibility of including some questions that were covered on the midterm or which are included in questions since the midterm. For example, I might ask you to identify a language's type and that type might be regular in which case you would need to construct an FSA or a regular expression for that language.