CSC 333 Automata, Grammers and Computability 
Study of three classical formal models of computationfinite state machines, contextfree grammars, and Turing machinesand the corresponding families of formal languages. Power and limitations of each model. Parsing. Nondeterminism. The Halting Problem and undecidability. The classes P and NP, and NPcompleteness. 3 credit hours. 

• Prerequisite  

Grade of C or better in CSC 226 Discrete Mathematics. 

• Course Objectives  
Upon successful completion of this course, a student will be able to...


• Course Requirements  
Grades will be based 50% on the Projects in Java, 15% on the Homework, 5% on the Lecture Assignments, 15% on the midterm exam, and 15% on the final exam. Exams are noncomprehensive. All exams are hometake exams, with three business days to complete each exam. 

• Textbook  
No textbooks are required. The instructor will provide all the relevant materials for the course. 

• Computer and Internet Requirements  
NCSU and Engineering Online have recommended minimum specifications for computers. For details, click here. 

• Instructor  
Dr. Nagiza Samatova, Professor Computer ScienceEngineering 2272 EBII NCSU Campus Raleigh, NC 27695 
Phone: 9195137575 
