Theory of Automata, Formal Languages and Computation

This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems. About The Author: S.P. Eugene Xavier is working in the Education and Research Department, Infosys Technologies Limited, Chennai. His main teaching and research interests include signal processing, systems engineering, web security and software engineering. He has published many textbooks in the area of Electronics & Communication Engineering and research papers in the area of Information Technology. He is a member of the Curriculum Development Cell in DOTE, ISTE as Board of Studies and Academic Advisory Board of various universities. Table Of Contents: Introduction? Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA) Context-Free Grammars? Pushdown Automata? Turing Machines? Chomsky Hierarchy? Computability? Complexity Theory? Propositions and Predicates? Answers to Exercises? University Question Papers? Bibliography?