CS 339 Midterm Review - Fall 2008

You should be able to: (In the following you may assume I mean either deterministic or non-deterministic FSA's)

1. Find a finite state automata for a given regular language.
2. Find a regular expression for a given language.
3. Recognize what language is represented by a finite state automata or a regular expression.
4. Convert a non-deterministic FSA into a deterministic one.
5. Simplify FSA's.
   
6. Know how to represent the union, intersection, difference, or symmetric difference of regular languages with a finite state automata.
7. Be able to prove that a language is not regular with the pumping lemma and other considerations.
8. Be able to construct a context-free grammar for a given language.
9. Be able to construct a regular grammar from a finite state automata.
10. Be able to construct a simple PDA for a context-free language.