Computer Science/Math 491A
Introduction to Complexity Theory
SEPTEMBER 2016
Lecture Notes
-
Mathematical Review
-
Basic Concepts and Notations
-
Example Language of Numbers
-
Other Automata Examples
-
Finite Automata (DFAs/NFAs)
-
Regular Expressions
-
Properties of Regular Languages
-
Rewriting Systems
-
Properties of Context Free Languages
-
Decidability and Computability, and Complexity
Last modified:Tuesday September 12, 2017 at 02:09 am ADT
Cezar Câmpeanu