Teaching‎ > ‎

Theory of Computation

This course introduces conceptual tools for reasoning about computational processes and the languages with which they are prescribed. It bears directly upon language translation, program verification, and computability. Topics to be covered include formal languages, finite automata, pushdown automata, nondeterminism, regular expressions, context-free grammars; parsing, compiler design basics; computability, Turing machines, Church’s thesis, unsolvability and intractability.
Ċ
Dr. Saleem Vighio,
Apr 14, 2015, 1:06 AM
Ċ
Dr. Saleem Vighio,
Apr 14, 2015, 1:06 AM
Ċ
CFG.pdf
(422k)
Dr. Saleem Vighio,
May 15, 2017, 11:00 PM
ć
Dr. Saleem Vighio,
Aug 11, 2017, 5:28 AM
Ċ
DFA.pdf
(809k)
Dr. Saleem Vighio,
Apr 12, 2017, 10:34 PM
Ċ
Dr. Saleem Vighio,
Apr 12, 2017, 10:33 PM
Ċ
NFA.pdf
(876k)
Dr. Saleem Vighio,
Apr 12, 2017, 10:35 PM
ć
Dr. Saleem Vighio,
Aug 11, 2017, 5:27 AM
Ċ
Dr. Saleem Vighio,
Jun 7, 2015, 10:42 PM
Ċ
TA.pdf
(1162k)
Dr. Saleem Vighio,
Apr 23, 2017, 9:40 PM
Ċ
Dr. Saleem Vighio,
Jul 21, 2017, 5:34 AM
Ċ
Dr. Saleem Vighio,
Jul 28, 2017, 5:48 AM