|
Jan 28, 2025
|
|
|
|
CIS 770 - Formal Language Theory Regular languages, finite automata, context-free languages, pushdown automata, context-sensitive languages, linear bounded automata, recursively enumerable languages, Turing machines.
Credits: (3)
Requisites: Pr.: MATH 510. Students may enroll in CIS courses only if they have earned a grade of C or better for each prerequisite to those courses.
KSIS Course Search
Add to Portfolio (opens a new window)
|
|