Automata and Computability van Dexter C. Kozen is an English-language textbook aimed at computer science. It provides a thorough introduction to automata and computability and is suitable as a first course for students who want to delve into theoretical models of computation.
The book covers fundamental concepts such as finite automata, pushdown automata, and Turing machines, and discusses complex topics such as effective computability, decidability, and Gödel's incompleteness theorems. By combining clear explanations with a variety of exercises, this textbook forms a valuable foundation for computer science programs.
The content aligns with fields such as Mathematical theory of computation, Algorithms and data structures, and computation model analysis. This makes it a relevant learning resource for students who want to orient themselves in theoretical computer science.
Springer Book Archives