CSC 333
Automata, Grammars, and Computability
North Carolina State University · UGRD · Fall 2026
1 section
Catalog 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.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #north_carolina_state-1357Fall 2026UGRD
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?