Editing Theory of computation (section)

==Further reading==
;Textbooks aimed at computer scientists
(There are many textbooks in this area; this list is by necessity incomplete.)
* {{Hopcroft, Motwani, and Ullman 2006}} — One of the standard references in the field.
*{{cite book|author=Linz P|title=An introduction to formal language and automata|year=2007 |publisher=Narosa Publishing|isbn=9788173197819|author-link=Linz P}}
* {{cite book|first = Michael |last=Sipser | year = 2013 | title = [[Introduction to the Theory of Computation]]|edition= 3rd |publisher =Cengage Learning |isbn=978-1-133-18779-0| author-link = Michael Sipser }}
* {{cite book | author = Eitan Gurari | year = 1989 | title = An Introduction to the Theory of Computation | url = http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk.html | publisher = Computer Science Press | isbn = 0-7167-8182-4 | url-status = dead | archive-url = https://web.archive.org/web/20070107040625/http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk.html | archive-date = 2007-01-07 | author-link = Eitan Gurari }}
* Hein, James L. (1996) ''Theory of Computation.''  Sudbury, MA: Jones & Bartlett.  {{isbn|978-0-86720-497-1}} A gentle introduction to the field, appropriate for second-year undergraduate computer science students.
* Taylor, R. Gregory (1998). ''Models of Computation and Formal Languages.''  New York: Oxford University Press.  {{isbn|978-0-19-510983-2}}  An unusually readable textbook, appropriate for upper-level undergraduates or beginning graduate students.
* Jon Kleinberg, and Éva Tardos (2006): ''Algorithm Design'', Pearson/Addison-Wesley, ISBN 978-0-32129535-4
* Lewis, F. D. (2007). ''[http://cse.ucdenver.edu/~cscialtman/foundation/Essentials%20of%20Theoretical%20Computer%20Science.pdf Essentials of theoretical computer science]'' A textbook covering the topics of formal languages, automata and grammars. The emphasis appears to be on presenting an overview of the results and their applications rather than providing proofs of the results.
* [[Martin Davis (mathematician)|Martin Davis]], Ron Sigal, Elaine J. Weyuker, ''Computability, complexity, and languages: fundamentals of theoretical computer science'', 2nd ed., Academic Press, 1994, {{isbn|0-12-206382-1}}. Covers a wider range of topics than most other introductory books, including [[program semantics]] and [[quantification theory]]. Aimed at graduate students.

;Books on computability theory from the (wider) mathematical perspective
* [[Hartley Rogers, Jr]] (1987). ''Theory of Recursive Functions and Effective Computability'', MIT Press. {{isbn|0-262-68052-1}}
* {{cite book|author = S. Barry Cooper | year = 2004 | title = Computability Theory | publisher = Chapman and Hall/CRC | isbn = 1-58488-237-9| author-link = S. Barry Cooper }}.
* [[Carl Herbert Smith|Carl H. Smith]], ''A recursive introduction to the theory of computation'', Springer, 1994, {{isbn|0-387-94332-3}}. A shorter textbook suitable for graduate students in Computer Science.

;Historical perspective
* {{cite book|author = [[Richard L. Epstein]] and [[Walter A. Carnielli]] | year = 2000 | title = Computability: Computable Functions, Logic, and the Foundations of Mathematics, with Computability: A Timeline (2nd ed.) | publisher = Wadsworth/Thomson Learning | isbn = 0-534-54644-7}}.