|
|
|
Oct 06, 2022
|
|
CS 312 - Logic, Computability, and Complexity (4)
FA, even years. Topics from the theory of computation including finite state concepts, formal languages and grammars, computability, computational complexity. Also listed as MATH 312 . Prerequisite: MATH 255 .
Add to Portfolio (opens a new window)
|
|
|