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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
K.L.P. MISHRA (Ph.D., Leningrad), had a distinguished career as Professor of Electrical and Electronics Engineering, and Principal, Regional Engineering College, Tiruchirapalli. N. CHANDRASEKARAN, Ph.D., is Professor of Mathematics at St. Joseph's College, Tiruchirapalli (an autonomous college, nationally accredited with five stars and a college selected for potential for excellence). He is a regular faculty at Bharathidasan Institute of Management, Tiruchirapalli and formerly served as a visiting professor at National Institute of Technology, Tiruchirapalli.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 6,86 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerEUR 10,23 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. 436. Artikel-Nr. 8352855
Anzahl: 2 verfügbar
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-12330
Anzahl: 2 verfügbar
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-243782
Anzahl: 2 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. M0-9788120329683
Anzahl: 1 verfügbar
Anbieter: Vedams eBooks (P) Ltd, New Delhi, Indien
Soft cover. Zustand: New. 3rd Edition. Contents Preface Notations 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 LRk Grammars 9 Turing Machines and Linear Bounded Automata 10 Decidability and Recursively Enumerable Languages 11 Computability 12 Complexity Answers to Self-Tests Solutions or Hints to Chapter-end Exercises Further Reading Index "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 " 436 pp. Artikel-Nr. 86016
Anzahl: 1 verfügbar
Anbieter: BooksRun, Philadelphia, PA, USA
Paperback. Zustand: Fair. 3rd. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Artikel-Nr. 8120329686-7-1
Anzahl: 1 verfügbar