Catalogue Entries |
2024 Fall
Jul 11, 2026 |
|
 |
||
 | To view further details on a course, select the Course Number/Name hyperlink (underlined). If the "Schedule Types:" listed are underlined (hyperlink), select any type listed to view scheduled class sections for the term chosen. |
| 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 |
|