What: Intraterm Exam 1

When: March 7, 2014

Topics:
  - Alphabet, symbols, strings, languages
  - Operations on strings & languages:
        concatenation, power, Kleene closure, positive closure
  - DFAs, NFAs
  - Regular Expressions
  - Equivalences of DFAs, NFAs (with or without epsilon-transitions),
    and Regular Expressions
  - Pumping Lemma for regular languages
  - Examples of nonregular languages
  - Closure of regular languages under the regular operations
    (union, concatenation, and Kleene closure), intersection,
    complementation, reversal

Exam Format:
  Closed book, closed notes, no computers, no mobile devices.
  Can bring in a notebook-sized paper with your notes written on it.
  Both sides of the paper may be used.
  No computer-generated printout allowed.