Upon successful completion of this course, a student will 
1. Understand regular languages and their modeling tools such as deterministic finite state automata (DFA), nondeterministic finite state automata (NFA) and regular expressions, 
2. Be able to apply fundamental proof techniques such as deductive, inductive proofs, and proofs by contradiction, 
3. Be familiar with context-free languages and their models such as context-free grammars (CFG) and push-down automata (PDA),
4. Be able to apply the pumping lemma to prove that a given language is not regular/not context-free,
5. Be able to model problems using different types of Turing Machines,
6. Be able to distinguish decidable and undecidable problems,
7. Be familiar with complexity classes such as P and NP..