3 Review(s)

About the Book: 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 a trainer and researcher whose research interest includes signal processing, web security, system engineering and software engineering. He has authored many text books in the area of electronics and communication engineering. He is a member of the curriculum development cell in DoTE. He is a life member of ISTE. He serves as a member of board of studies in various Universities and also a member of academic advisory board in various institutions. Contents: Introduction Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA) Context-Free Grammars Pushdown Automata Turing Machines ChomskyHierarchy Computability Complexity Theory Propositions and Predicates Answers to Exercises University Question Papers Bibliography Index.