| |
Nov 23, 2024
|
|
|
|
|
2018-2019 Academic Catalog [ARCHIVED CATALOG]
|
CSC 341 - Automata, Formal Languages, and Computational Complexity4 credits (Fall and Spring)
A formal study of computational devices, their related languages, and the possibility and difficulty of computations. Examples are pushdown automata and Turing machines, context-free languages and recursively enumerable sets, and the halting problem and NP-completeness.
Prerequisite: CSC 207 and either MAT 218 , or MAT 208 .
Note: Plus-2 option available.
Instructor: Osera, J. Stone
|
|
