Automata and Computability

The book has been developed to provide comprehensive and consistent coverage of concepts of automata theory, formal languages and computation.This book begins by giving prerequisites for the subject, like strings, languages, types of automata, deterministic and non-deterministic automata. It proceeds forward to discuss advanced concepts like regular expressions, context free grammar and pushdown automata. The text then goes on to give a detailed description of context free and non context free languages and Turing Machine with its complexity.This compact and well-organized book provides a clear understanding of the subject with its emphasis on concepts along with a large number of examples.