Course info

Prove the equivalence of regular expressions and finite automata.

Acquire insights into the relationship among context free languages and context free grammars

Construct and prove the equivalence of languages described by pushdown automata and context free grammars.

Realize the concepts of Turing machines and its construction methods.

Recognize the concepts of undecidability and complexity theory.