CS35103 — Theory of Computation

CS 35103 - Theory of Computation CS 35103 - Theory of Computation This course introduces students to the concepts of languages, automata, computability theory, and complexity theory. Topics covered include regular languages, context-free languages, Turing machines, and parsing. On Demand Semester Hours: 3

Prerequisites: CS22003, MTH25403