Theory of Computation, 1/e
View Larger

Theory of Computation, 1/e

Author : S.N. Sivanandam & M. Janaki Meena
© Year : 2009
ISBN : 9789380026206
Pages : 520
Binding : Paperback
Weight : 0.74   kg
Discount : 20.00  %
Price :   24.00      19.20
Buy Now

Request a Specimen Copy

Buy online using : Credit Card / Debit Card / Internet Banking

  • About the Book
  • Salient Features
  • Table of Contents
  • About the Author

The book is meant for a wide range of students doing their undergraduation and postgraduation courses related to Computer Science. All the concepts are elaborated with illustrations. Algorithmic procedures are provided at the necessary locations. Numerous examples are given for similar but different kinds of problems. Problems similar to the examples are given as Exercises. Objective questions with solutions are given at the end of each chapter.
The basic concepts of automata theory, various types of automata and their limitations are given with examples. Turing machines are also dealt with in this book and the execution of Turing machines is traced for better understanding. Classification of decidable and undecidable problems is dealt with in detail.
The book will also be useful for students who are preparing for competitive examinations.

  • Detailed explanation of the concepts in formal languages and automata theory
  • Several pictorial representations for better understanding.
  • Simple stepwise procedure for designing finite and pushdown automata, designing Turing machines for recognizing languages and computing functions.
  • Tracing the execution of the automata and Turing machines designed.
  • Decidability and intractability are dealt with simple illustrations.
  • About 350 solved problems, 200 exercise problems and 225 objective questions with answers.
  • Syllabus covered for Theory of Computation of B.E., B.Tech, BCA, MCA, M.Sc and M.E. of various universities.

  • Basic Mathematical Concepts
  • Proof Techniques
  • Regular Languages and Finite Automata
  • Non-Deterministic Finite Automata
  • Properties of Regular Languages
  • Context Free Grammars
  • Push Down Automata
  • Context Free Languages and Non-Context Free Languages
  • Turing Machines
  • Extensions to Basic Turing Machines
  • Chomsky’s Hierarchy and Decidability
  • Tractability
  • Index

S.N. Sivanandam :- Professor and Head, Computer Science & Engineering Department, PSG College of Technology, Coimbatore, Tamil Nadu.

M. Janaki Meena :- Senior Lecturer, Department of Computer Science and Engineering, PSG College of Technology, Coimbatore, Tamil Nadu

Your Browsing History

Theory of Computation

By : S.N. Sivanandam

Discount : 20.00 %

Price :   24.00      19.20

Buy Now

Top Sellers

Power Plant System Design

Power Plant System Design

By : Kam W. Li

Discount : 20.00 %

Price :  

A Textbook of Digital Electronics

A Textbook of Digital ...

By : S.S. Bhatti

Discount : 20.00 %

Price :   24.00    

Building with Stabilized Mud

Building with Stabilized Mud

By : K.S. Jagadish

Discount : 20.00 %

Price :   7.00    

Customers who saw this book also saw

Communication, Technology for Development

Communication, Technology for ...

By : Parveen Pannu

Discount : 20.00 %

Price :   47.00      37.60

Cellular and Biochemical Science

Cellular and Biochemical ...

By : G. Tripathi

Discount : 20.00 %

Price :   92.00      73.60

Design and Analysis of Algorithms

Design and Analysis of ...

By : V.V. Muniswamy

Discount : 20.00 %

Price :   26.00      20.80

Lasers and Optical Instrumentation

Lasers and Optical ...

By : S. Nagabhushana

Discount : 20.00 %

Price :   35.00      28.00