Students requesting deficiency waiver for CSE 355 must provide supporting 
documents e.g., transcript and syllabus for the relevant courses in which 
you learned CSE 355 materials. The topics that are covered in CSE 355 include

- regular languages 
- finite automata 
- context-free languages 
- pushdown automata 
- pumping lemma
- Turing machines
- Church-Turing Thesis
- decidability
- reducibility. 
- P vs NP

(These roughly correspond to Ch 1-5, and 7 of Sipser's book.)

Typically students encounter regular languages, finite automata, and
context-free languages in other courses such as digital circuit design,
programming languages, algorithms, and compilers. This is NOT enough 
to request waiver. CSE 355 covers their mathematical foundations in 
solid bases and more. If you have not learned how to prove certain 
languages are not regular using the pumping lemma, how to prove 
certain problems are undecidable by reducing the Halting problem, and
how to prove NP-completeness, you'd need to take the course.

If I find that your supporting documents are okay, you'll need to
demonstrate your knowledge by taking the comprehensive written test. 
If you mark over 75%, you'll be granted waiver. 

You should request consideration for waiver by August 13th. The test
will be given on 

   **August 20th, from 10:30AM to noon, in BY 576**. 

It will be given only to students who submitted supporting documents 
by August 13th. Late requests should be waited until the beginning 
of the Spring semester.