CSc 30400 Introduction to Theoretical Computer Science

Fall 2008


Instructions on the exam

The exam contains 7 questions. You have to choose 5 of them. Each question gives you 20 points. The questions are the following:
  1. NFAepsilon -> NFA
  2. NFA -> DFA
  3. DFA -> min DFA
  4. reg. expr. -> NFA
  5. DFA -> reg. expr.
  6. A formal proof that the regular languages are closed under an operation
  7. you will find out on Tuesday ... :-)

Some instructions: