Theory of computation textbooks

[NATURE.M]

I want to know what textbooks you would recommend to prepare for a very challenging course on computational theory that I'll be taking in the fall.

Brief description: The rigorous application of logic and proof techniques to Computer Science. Propositional and predicate logic; mathematical induction and other basic proof techniques; correctness proofs for iterative and recursive algorithms; recurrence equations and their solutions (including the “Master Theorem”); introduction to automata and formal languages.

I don't really have a strong background into computational theory. I'm only familiar with very basic complexity theory. But the course doesn't require any added prerequisites. Its just an accelerated introduction.

 

[Aaron Bex]

1. Introduction to the Theory of Computation (3rd Edition) by Michael Sipser.
2. Introduction to Automata Theory, Languages, and Computation (3rd Edition) by John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman.
3. Introduction to Formal Languages, Automata Theory, and Computation (2nd Edition) by Kishor S. Trivedi.
4. Automata and Computability (2nd Edition) by Dexter C. Kozen.
5. Fundamentals of Computer Science: Theory and Practice by J. Glenn Brookshear.
6. Algorithms and Theory of Computation Handbook (2nd Edition) by Michael J. Atallah.
7. Computation Theory: An Introduction by H.R. Lewis and C.H. Papadimitriou.
8. Handbook of Theoretical Computer Science, Vol. A & B by Jan van Leeuwen.