Go to Main Content

UNBC Direct Access Web

 

HELP | EXIT

Catalog Entries

 

2020 January Semester
Oct 14, 2019
Transparent Image
Information Select the Course Number to get further detail on the course. Select the desired 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


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2