Theory of Computation ((3 Credits))

Catalog description

Introduction to automata and languages, computability and complexity of algorithms. This course covers graph theory, finite state automata, determinism non-determinism, regular expressions, context free and non-context free grammars, algorithm definition, algorithm complexity, class P, class NP algorithms and NP-completeness.