|
Jan 02, 2025
|
|
|
|
CS 518 - Theory of Computation 4 credits Covers formal language and automata theory from finite state automata to Turing machines. Presents the Chomsky hierarchy of languages and the relationship between languages and automata. Prerequisite(s): CS 411 or CS 511 . Graded (A-F) only.
Add to Portfolio (opens a new window)
|
|