 |
| Theory of Computation |
Key Features
- Offers a gentle and gradual introduction of the necessary mathematical tools in the context in which they are used.
- Emphasizes on formal languages, automata and abstract models of computation, and computability, and it includes an introduction to computational complexity and NP-completeness.
- Martin offers an enormous number and variety of exercises.
- Solved Exercises
- Unsolved Exercises
- More challenging Problems
- Emphasizes formal languages, automata and abstract models of computation, and computability.
- Includes an introduction to computational complexity and NP-completeness.
- Offers an enormous number and variety of exercises
Table Of Contents
- Preface
- Introduction
- PART 1: MATHEMATICAL NOTATION AND TECHNIQUES
- Chapter 1: Basic Mathematical Objects
- Chapter 2: Mathematical Induction and Recursive Definitions
- PART II: REGULAR LANGUAGES AND FINITE AUTOMATA
- Chapter 3: Regular Expressions and Finite Automata
- Chapter 4: Nondeterminism and Kleene?s Theorem
- Chapter 5: Regular and Nonregular Languages
- PART III: CONTEXT- FREE LANGUAGES AND PUSHDOWN AUTOMATA
- Chapter 6: Context-Free Grammars
- Chapter 7: Pushdown Automata
- Chapter 8: Context-Free and Non-Context- Free Languages
- PART IV: TURING MACHINES AND THEIR LANGUAGES
- Chapter 9: Turning Machines
- Chapter 10: Recursively Enumerable Languages
- PART V: UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS
- Chapter 11: Unsolved Problems
- Chapter 12: Computable Functions
- PART VI: INTRODUCTION AND CLASSIFYING COMPLEXITY
- Chapter 13: Measuring and Classifying Complexity
- Chapter 14: Tractable and Intractable Problems
- References
- Bibliography
- Index of Notation
- Index
Details of Ebook
Ebook: Introduction To Languages And The Theory Of Computation (SIE)
Author: John Martin
ISBN: 0070660484
ISBN-13: 9780070660489, 978-0070660489
File Type: RAR
File Size: 14 MB
Publisher: Tata Mcgraw Hill Education Private Limited
Edition: 3rdEdition
Number of Pages: 560
Language: English