Read our cookies policy and privacy statement for more information.
×Fullerton, California
Introduction to the theory of computation. Automata theory; finite state machines, context free grammars, and Turing machines; hierarchy of formal language classes. Computability theory and undecidable problems. Time complexity; P and NP-complete problems. Applications to software design and security
Units: 3.0