CS 520

## Credits:

3

Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography. Prereq: CS 240, and CS 367, or consent of instructor.