Automata and Computability

This class-tested textbook provides a comprehensive and accessible introduction to the theory of automata and computation. It incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda calculus.