CS 411

Computability and Formal Languages

Lec 001 selected

The notion of effective procedure and Turing machine. The universal Turing machine. Nondeterministic Turing machine. Recursive functions and other computable functions. The halting problem and unsolvability. Grammar and formal language. Finite automata and regular grammars. Context-free grammars and push-down automata. Post correspondence problem. The Chomsky hierarchy of languages and context-sensitive language. ***

Sections

Lecture

Lec 001

Wed 19:00-21:45

Wed19:00-21:45Classroom Building 12530745

Syllabus

Have the syllabus for CS 411? Share it and everyone gets the grading, textbooks and rules.