HOME  |  EOL CALENDAR  |  CONTACT US   

    CSC 333 Automata, Grammars and Computability
    Syllabus    |      Video Lectures & Notes     |     Logistics   

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. 3 credit hours.

 
   

Instructor
 

Dr. Nagiza Samatova, Professor
Computer Science-Engineering
2272 EBII
NCSU Campus
Raleigh, NC 27695

Phone: 919-513-7575
Fax:
919-515-7896
Email:
samatova@csc.ncsu.edu


   
    CSC 333 Moodle Course Website