CRN 50195 Theory of Computation - CPSC 340 - A1 |
---|
This course examines regular expressions, deterministic and non-deterministic finite automata, context-free and other grammars, pushdown automata, Chomsky and Greibach normal forms. Chomsky hierarchy, pumping lemmas, Turing machines, undecidability, computability, recursive function theory, computational complexity, NP-hard and NP-complete problems.
Levels:  Undergraduate Campus:   Prince George Schedule Type:  Lecture Instructional Method: On campus, face to face Credits:   3.000 |
Return to Previous |