CS702: Theory of Computer Science
TB = Textbook or Required reading 
REF = Reference or supplemental reading
|
Type |
..................... | Title |
eBook |
|
Call Number |
|
J. E. Hopcroft, R. Motwani, J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Wesley, 2001.
|
ProQuest | Yes | QA267 .H56 2014 | |
|
 |
M. Sipser, Introduction to the Theory of Computation. Cengage Learning, 2012.
|
(access through moodle )
|
Yes | QA267 .S56 2013 |
|
 |
S, Arora, B, Barak, Computational Complexity: A Modern Approach. Cambridge University Press, 2009. | Computational Complexity (cambridge.org) | On order | |
|
 |
M. Sipser, CS103: Mathematical Foundations of Computing Overview. Stanford University. | CS103 (stanford.edu) | NA | |
|
 |
E. Lehman, F. Leighton, & R. Meyer, Mathematics for Computer Science. MIT OpenCourseWare, 2018. |
Mathematics for Computer Science (Lehman, Leighton, and Meyer) - Engineering LibreTexts | NA | |
|
 |
M. Fleck, Building Blocks: CS 225 Course Material, University of Illinois. |
Building Blocks for Theoretical Computer Science (illinois.edu) | NA |