| |
Apr 19, 2024
|
|
|
|
|
CSCI 2400 - Models of Computation
This course introduces conceptual tools for reasoning about computational processes and the languages with which they are prescribed. It bears directly upon language translation, program verification, and computability. Topics to be covered include formal languages, finite automata, pushdown automata, nondeterminism, regular expressions, context-free grammars; parsing, compiler design basics; computability, Turing machines, Church’s thesis, unsolvability and intractability.
Prerequisites/Corequisites: Prerequisites: CSCI 2300 and MATH 2800.
When Offered: Fall and spring terms annually.
Credit Hours: 4
Add to Portfolio (opens a new window)
|
|
