What
Intraterm Exam 1
When
March 8, 2016, 1:30-2:20pm
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, etc.
Exam Format
Closed book, closed notes, no electronic devices.
Can bring in a notebook-sized hand-written note. Both sides are ok for use but computer-generated printout is not allowed.