3 Review(s)

The book is all about the automata, formal language theory and computability. Automata theory plays important roles in compilers, text processing, programming languages, hardware designs and artificial intelligence and is the core base of computer science studies. The intent is to make automata theory interesting and challenging and break the myth of being a tough topic. For that matter, topics are covered in an easy to understand manner with the help of elaborative and well descripted examples. For topics which are little complex and fuzzy to understand, strategy adopted is to connect the topic with the everyday problems we encounter, in order to develop a connective understanding of the topic and get a clear view of the topic. Exercise questions are provided with the answers to understand the solution easily. To understand automata theory, languages of machines and computability in an easier and interesting way. Tough topics are covered in the way that is relatable to daily life which enables the reader to grasp the topic easily. Exercise questions along with the solutions to understand the solutions of the queries. Along with elaborative solved examples, questions from various universities exams; also includes solved GATE and UGC-NET questions. The prospective audience for the book are computer science engineering students. Computer science scholars and people preparing for competitive exams like GATE, UGC-NET, etc.