|
Jan 30, 2025
|
|
|
|
CIS 770 - Formal Language TheoryCredits: (3)
Regular languages, finite automata, context-free languages, pushdown automata, context-sensitive languages, linear bounded automata, recursively enumerable languages, Turing machines.
Requisites Prerequisite: 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.
UGE course No
K-State 8 None
KSIS Course Search
Add to Portfolio (opens a new window)
|
|