Elements of the Theory of Computation

by Harry R. Lewis

The book introduces the classical and contemporary theory of computation. It has been designed for the use of undergraduates in a way that is mathematically sound yet at the same time does not presuppose special mathematical experience. Provides deeper insight into specific topics in computer science and established essential mathematical paradigms. Includes the theory of automata and formal languages, computability by Turing machines and recursive functions, uncomputability, computational complexity, and mathematical logic. The text includes numerous examples that illustrate the basic concepts and chapter-end problems, which enhance the value of the book.

Genres: Computer Science, Science, Textbooks, Mathematics, Reference, Programming, Technology

Paperback

First published February 1, 1981

Reviews

[Daniel Maturana · Rating 5 out of 5]

I found this book to have a more intuitive approach and friendlier notation than Hopcroft's Introduction to Automata Theory. Pretty dry stuff but when you get to the end it's all worth it.

[Robert · Rating 4 out of 5]

Classic.

[Manoj Khatri · Rating 4 out of 5]

Notations are quite clumsy. Might not be suitable for computer science majors. Overall a great book.

[Frank Palardy · Rating 4 out of 5]

Tricky stuff.

[Vivek Khurana]

Anyone who thinks he can review this book is over-rating himself.