Theory of Computation
- ISBN-10
- 938002620X
- ISBN-13
- 9789380026206
- Series
- Theory of Computation
- Category
- Computational complexity
- Pages
- 506
- Language
- English
- Published
- 2009-01-01
- Publisher
- I. K. International Pvt Ltd
- Author
- S. N. Sivanandam
Description
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. SALIENT FEATURES OF THE BOOK " 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.
Get the book
Other editions
-
- 1989
- 322 pages
- Paperback
- Benjamin/Cummings Publishing Company
Similar books
-
Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis
By Iris van Rooij, Mark Blokpoel, Johan KwisthoutCognition and Intractability is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.
-
Theory Of Automata, Formal Languages And Computation (As Per Uptu Syllabus)
By S.P.Eugene XavierConsider the toy shown in Fig. 1.222. A marble is dropped at A or B. Levers x1,x2,x3 cause the marble to fall either to the left or to the right. Whenever a marble encounters a lever, it causes the lever to reverse after the marble ...
-
Introduction to Automata Theory, Languages, and Computation
By John E. HopcroftIntroduction to Automata Theory, Languages, and Computation
-
Kolmogorov Complexity and Algorithmic Randomness
By A. Shen, V. A. Uspensky, N. VereshchaginLooking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why?...
-
Classical and Quantum Computation
By Alexander Shen, Alexei Yu. Kitaev, Mikhail N. VyalyiAn introduction to a rapidly developing topic: the theory of quantum computing. Following the basics of classical theory of computation, the book provides an exposition of quantum computation theory.
-
Introduction to Automata Theory, Languages, and Computation: Pearson New International Edition
By John E. Hopcroft, Jeffrey D. Ullman, Rajeev MotwaniThis new edition comes with Gradiance, an online assessment tool developed for computer science. Please note, Gradiance is no longer available with this book, as we no longer support this product.
-
Introduction to the Theory of Computation
By Michael Sipser"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation.
-
Proceedings The 2008 International Conference on Computational Science and Its Applications: ICCSA 2008
By ICCSA 2008Proceedings The 2008 International Conference on Computational Science and Its Applications: ICCSA 2008
-
What Is a Complex System?
By James Ladyman, K. WiesnerA clear, concise introduction to the quickly growing field of complexity science that explains its conceptual and mathematical foundations What is a complex system?
-
Foundations of Logic and Theory of Computation
By Cristina Sernadas, A. SernadasThe book provides a self-contained introduction to mathematical logic and computability theory for students of mathematics or computer science.