Go to Main Content

UNBC Direct Access Web

 

HELP | EXIT

Course Schedule: Results

 

2022 September Semester
Aug 12, 2022
Transparent Image

Sections Found
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


Scheduled Meeting Times
Type Time Days Where Date Range Schedule Type Instructors
Class 4:30 pm - 5:50 pm MW Geoffrey R Weller Library 5-176 Sep 07, 2022 - Dec 06, 2022 Lecture Liang Chen (P)E-mail
Exam TBA   TBA Dec 08, 2022 - Dec 19, 2022 Final Exam TBA



Return to Previous
Transparent Image
Skip to top of page Select New Term

 

Release: 8.7.2.6