# Theory Of Computation Aa Puntambekar Pdf 126

## Theory of Computation by Aa Puntambekar: A Book Review

Theory of Computation is a subject that deals with the study of abstract models of computation, such as finite automata, pushdown automata, Turing machines, and grammars. It also explores the properties and limitations of these models, such as decidability, undecidability, complexity, and hierarchy.

## theory of computation aa puntambekar pdf 126

One of the books that covers this subject in a comprehensive and rigorous way is Theory of Computation by Aa Puntambekar. This book is written for undergraduate and postgraduate students of computer science and engineering, as well as for those who are preparing for competitive exams like GATE.

## Features of the Book

The book has the following features:

It covers all the topics of theory of computation in a systematic and logical way.

It provides stepwise presentation of computational problems for easier understanding.

It uses neat diagrams and examples to illustrate the concepts.

It provides more than 250 solved examples and chapterwise university questions with answers.

It follows an examination oriented approach and covers all the GATE topics in detail.

## Contents of the Book

The book is divided into eight chapters, which are:

Fundamentals: This chapter introduces the basic concepts and definitions of theory of computation, such as alphabet, string, language, grammar, automaton, etc.

Finite Automata: This chapter deals with the simplest model of computation, which is finite automaton. It explains deterministic and non-deterministic finite automata, equivalence and minimization of finite automata, regular expressions and regular languages.

Regular Languages: This chapter explores the properties and limitations of regular languages, such as closure properties, pumping lemma, Myhill-Nerode theorem, etc.

Grammar Formalism: This chapter introduces the concept of grammar as a generative device for languages. It explains different types of grammars and their relation to Chomsky hierarchy of languages.

Context Free Grammars: This chapter focuses on context free grammars and languages, which are more expressive than regular languages. It explains parsing and ambiguity of context free grammars, grammar transformations, normal forms, etc.

Push Down Automata: This chapter deals with push down automaton as a computational model for context free languages. It explains deterministic and non-deterministic push down automata, equivalence and conversion between context free grammars and push down automata.

Turing Machine: This chapter introduces the most powerful model of computation, which is Turing machine. It explains the definition, model, design, computable functions, recursively enumerable languages, Church's hypothesis, counter machine, types of Turing machines.

Computability Theory: This chapter explores the limitations and unsolvability of computation. It explains decidability and undecidability of problems, universal Turing machine, halting problem, post correspondence problem, Turing reducibility, P and NP problems, NP complete and NP hard problems.

## Conclusion

Theory of Computation by Aa Puntambekar is a book that provides a thorough and rigorous treatment of the subject. It is suitable for students who want to learn the subject in depth and prepare for competitive exams. The book is available in PDF format for free download from various sources on the internet. c481cea774