Sep 28, 2022  
2021-2022 University Catalog 
    
2021-2022 University Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CPSC 439 - Theory of Computation (3)


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.

Prerequisites: CPSC 121  or MATH 320 ; MATH 270B  or MATH 280 ; or Computer Science or Computer Engineering graduate standing.

400-level Undergraduate Course available for Graduate Credit



Add to Portfolio (opens a new window)