next up previous
Next: About this document

cse4083/5083 Formal Languages
Guide for Exam 2.

You will be tested on your ability to do the following:

  1. Given a description of a regular language L, generate a finite automata (NFA or DFA) that accepts strings from L, or a regular grammar that derives strings from L.
  2. Given an NFA, construct an equivalent DFA.
  3. Given an NFA M, construct a regular expression that defines L(M).
  4. Demonstrate that a language is regular.
  5. Demonstrate that a language is not regular.
  6. Given a description of a context-free language L, construct a PDA that accepts strings from L.




Robert Morris
Wed Mar 18 16:08:28 EST 1998