: Significant emphasis on the design, models, and applications of Turing Machines, including the Church-Turing thesis.

: Covers Pushdown Automata (PDA) and the grammars that generate context-free languages. Advanced Automata : Discusses Linear Bounded Automata (LBA) Turing Machines (TM) Computability and Complexity

The ultimate champion of the land. Nagpal placed special emphasis on these, for they could solve any problem that was "computable," though they also revealed the dark truth of Undecidability

The book is divided into 12 chapters, covering the following topics: