Automata and Computability: Undergraduate Textbook in Computer Science by Dexter C. Kozen | Theory of Computation, Formal Languages, Turing Machines | Perfect for CS Students and Researchers

This book consists of lecture notes - in the old fashioned understanding of the word - that could be taken straight from the blackboard with a few expositions in between. The format has helped to keep the contents to a reasonable minimum, without the depth of the "Automata Theory, Languages, and Computation" book by Hopcroft and Ullman, but it also makes it exceptionally well suited to a course at the undergraduate / lower graduate level. A good student should be able to go through the text by her/him-self and get a good understanding of a philosophically important field within Computer Science.