CSC 333
Automata, Grammars, and Computability:
Section: 601

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

Fall 2021

Instructors

Meeting Patterns

Classes Start:
August 16, 2021
Classes End:
November 29, 2021
Distance Education:
Yes
Class Days:
[TBA]

Class Type:
Lecture
Credits:
3.00
Restrictions:
Enrollment for this course is through the Engineering Online Registration System. Go to http://go.ncsu.edu/eol_registration

Tools