Elements of computation theory / by Arindama Singh
Material type: TextPublication details: New Delhi : Springer, 2011, 2009cDescription: xiii, 415p. : ill. ; 24cmISBN: 9788132203001 (pbk)Subject(s): Computable functionsDDC classification: 004Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Books | Namal Library Computer Science | 004 SIN-E 2011 1177 (Browse shelf (Opens below)) | Available | 1177 |
Index included
Chapter 1: Mathematical Preliminaries.------------------
Chapter 2: Regular Languages.---------------------
Chapter 3: Equivalences.--------------------
Chapter 4: Structure of Regular Languages.-------------------
Chapter 5: Context-free Languages.--------------------
Chapter 6: Structure of CFLs.-----------------
Chapter 7: Recursively Enumerable Languages.------------------
Chapter 8: A Non-recursively Enumerable Language.----------------
Chapter 9: Algorithmic Solvability.---------------------
Chapter 10: Computational Complexity.------------------------
This book introduces the fundamental concepts, models, techniques, and results that form the basic paradigms of computing. It examines all the essential topics in formal languages, automata,
There are no comments on this title.