CSC 333
Automata, Grammars, and Computability
Section: 651

Course Description

Study of three classical formal models of computation--finite state machines, context-free grammars, and Turing machines--and the corresponding families of formal languages. Power and limitations of each model. Parsing. Non-determinism. The Halting Problem and undecidability. The classes P and NP, and NP-completeness.

DE Fee

Engineering Online UGRD

DE Program

Computer Certificate Program

SUM1 10W 2020

Instructors

Classes Start:
May 13, 2020
Classes End:
July 24, 2020
Distance Education:
Yes
Class Type:
Lecture
Credits:
3.00
Delivery Method:
Internet
Restrictions:
Prerequisite: Grade of C or better in either MA 225 or CSC 226 Enrollment for this course is through the Engineering Online Registration System. Go to http://go.ncsu.edu/eol_registration

Tools