1. Michael Sipser. Introduction to the theory of computation: second edition. PWS Pub., Boston, 2 edition, 2006.
   Note: 96035322 Michael Sipser. Includes bibliographical references (p. - ) and index. Pt. 1. Automata and Languages. 1. Regular Languages. 2. Context-Free Languages -- Pt. 2. Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced topics in complexity theory.
   Keywords: computational complexity, honours reading. [bibtex-entry]



2. Michael Sipser. Introduction to the theory of computation. PWS Pub., Boston, 1997.
   Note: 96035322 Michael Sipser. Includes bibliographical references (p. - ) and index. Pt. 1. Automata and Languages. 1. Regular Languages. 2. Context-Free Languages -- Pt. 2. Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced topics in complexity theory.
   Keywords: computational complexity, honours reading. [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.