Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

CS 411 - Computability and Formal Languages
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. * Prerequisite: CS 310 * 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Undergraduate Graduate

CS 411 - Computability and Formal Languages

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. *** Prerequisite: CS 310 ***
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture, Examination

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:
Undergraduate
Graduate

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

UR Self-Service

Detailed Course Information

© 2024 Ellucian Company L.P. and its affiliates.