Course information

This course covers finite sets machines, regular expressions, context free grammar, push down automata and Turing machines for modeling a given language, and define the classes P and NP.