Corne de Ridder

This is an excellent introduction to Automata Theory for computer scientists without a very formal mathematical background. The book deals with formal languages and provides numerous examples of Finite Automata and other regular language acceptors, Transducers, Push Down Automata and Turing Machines. Readers are also exposed to grammars that generate languages, accepted by the respective pre-mentioned machines. Furthermore, there are dealt with the concepts decidability and computability. This book introduces its readers, in my opinion, to Automata Theory in the simplest possible way. Towards the end of the book languages defined are classified into the Chomsky Hierarchy of languages.