Automata and Computability

af Dexter C. Kozen

This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. Pushdown automata provide a broader class of models and enable the analysis of context-free languages.