Go to Main Content

UNBC Direct Access Web

 

HELP | EXIT

Detailed Course Information

 

2022 September Semester
Jul 05, 2022
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

CPSC 340 - Theory of Computation
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.
Credits: 3.000

Levels: Undergraduate
Schedule Types: Lecture, Self-Directed, Final Exam, Lec/Lab/Tut Combination, Laboratory


Information

Green prerequisites must be completed before registering in this course

Red prerequisites can be taken concurrently with this course

Magenta co-requisites must be taken at the same time as this course

Prerequisites:
( CPSC 142 Minimum Grade of C- or CPSC 242 Minimum Grade of C- )

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4