Like a book: Introduction to Automation Theory, ages, and Computation

Although this book has many ArticleSome people have recommended this, but I still want to like it, because this is my own
. This book is written by John E. hopcroft, Rajeev motwani, Jeffrey D. Ullman.
Introduction to automata theory, ages, and computation. When I first read this book
He thinks that the basic methods and ideas that he wrote in roilbarso have been proven in the first chapter.
I'm impatient. Although I haven't looked at this chapter in detail yet, I am faced with proof methods like mutual induction.
I was inspired by the thorough explanation. In the middle of the book, I will explain the finite automatic machines, Turing machines, and other types of automatic machine models,
For each type of automatic machine, we should first explain why such an automatic machine should be introduced.
View the image, or even the author's own feelings, the reader's feelings, and so on. The proof of each theorem and theorem is large.
Intuition induction (intuitive reasoning) is provided first, and then the formal proof is provided. In particular
The proof is very clear, impressive, and memorable.
(I think this is the difference between a good book and a non-good book. A good book usually gives you a big intuitive image, so that you can have a good reputation.
And you will not be lost in the details of the formal proof ).
In the last few chapters, we upgraded from the Turing machine to the deterministic problem, and the computer was hard to solve the problem. I have not looked at it carefully. Prepare
After winter vacation, I believe that I will have a deeper understanding of the computer's hard-to-solve problems.
In general, this book is both intuitive and rigorous. It is profound and vivid. This book
The evaluation is a small summary of one of the best books I have read this semester. I also hope to activate the cstheory version and let it go.
Sorry, I 'd like to share some of your good books.