Automata, computability and complexity : theory and applications Elaine Rich
Material type: TextLanguage: English Publication details: Noida : Pearson Education, 2012.Description: xx, 1099 pages : illustrations ; 25 cmISBN:- 9788131788226
- 511.3 RIC
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
General Books | CUTN Central Library Sciences | Non-fiction | 511.3 RIC (Browse shelf(Opens below)) | Available | 36639 | |
General Books | CUTN Central Library Sciences | Non-fiction | 511.3 RIC (Browse shelf(Opens below)) | Available | 36640 |
Browsing CUTN Central Library shelves, Shelving location: Sciences, Collection: Non-fiction Close shelf browser (Hides shelf browser)
511.3 LEW Elements of the theory of computation / | 511.3 MAR Introduction to languages and Theory of Computation | 511.3 MIN An introduction to Kolmogorov complexity and its applications / | 511.3 RIC Automata, computability and complexity : | 511.3 RIC Automata, computability and complexity : | 511.3 SIP Introduction to the theory of Computation | 511.3 SRI A Textbook on Automata Theory/ |
Finite state machines and regular languages --
Context-free languages and pushdown automata --
Turing machines and undecidability --
Complexity.
Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key concepts by introducing important uses of techniques in real systems. Broad-ranging coverage allows instructors to easily customize course material to fit their unique requirements.
There are no comments on this title.