Theory of Computer Science Automata Languages and Computation 3rd Edition by K L P Mishra, N Chandrasekaran ISBN 8120329686 9788120329683

Theory of Computer Science Automata Languages and Computation 3rd Edition by K.L.P. Mishra, N. Chandrasekaran – Ebook PDF Instant Download/Delivery: 8120329686, 9788120329683

Full download Theory of Computer Science Automata Languages and Computation 3rd Edition after payment

 

Product details:

ISBN 10: 8120329686 

ISBN 13: 9788120329683

Author: K.L.P. Mishra, N. Chandrasekaran

This Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries.Features new to this edition are: expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2); a rigorous proof of Kleene’s theorem (Chapter 5); major changes in the chapter on Turing machines (TMs); a new section on high-level description of TMs; techniques for the construction of TMs; multitape TM and nondeterministic TM; a new chapter (Chapter 10) on decidability and recursively enumerable languages; a new chapter (Chapter 12) on complexity theory and NP-complete problems; a section on quantum computation in Chapter 12; objective-type questions in each chapter – with answers provided at the end of the book; eighty-three additional solved examples – added as Supplementary Examples in each chapter; and detailed solutions at the end of the book to chapter-end exercises.The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.

Table of contents:

1: Propositions and Predicates

2: Mathematical Preliminaries

3: The Theory of Automata

4: Formal Languages

5: Regular Sets and Regular Grammars

6: Context-Free Languages

7: Pushdown Automata

8: LR(k) Grammars

9: Turing Machines and Linear Bounded Automata

10: Decidability and Recursively Enumerable Languages

11: Computability

12: Complexity

13: Answers to Self-Tests

14: Solutions (or Hints) to Chapter-end Exercises

15: Further Reading

People also search for:

borrow theory of computer science automata languages and computation
theory of computer science automata languages and computation pdf
theory of computer science automata languages and computation pdf download
theory of computer science automata languages and computation mishra klp
theory of computer science automata languages and computation third edition

Tags: K L P Mishra, N Chandrasekaran, Theory, Computer, Science, Automata, Languages, Computation