Image from Amazon.com
Automata, computability and complexity : theory and applications / Elaine Rich.
Material type:
TextLanguage: English Publication details: New Delhi : Pearson , c2012.Description: xx, 1099 pISBN: - 9788131788226
- 0132288060
- 519.713 RIC
Contents:
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Books
|
Department of Computer Science General Stacks | 519.713 RIC (Browse shelf(Opens below)) | Available | MCS05570 | |
|
Books
|
Department of Computer Science General Stacks | 519.713 RIC;1 (Browse shelf(Opens below)) | Available | MCS05654 |
Browsing Department of Computer Science shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 519.713 MOR The theory of computation | 519.713 MOR The theory of computation | 519.713 RIC Automata, computability and complexity : | 519.713 RIC;1 Automata, computability and complexity : | 519.713 ROS (The) Pillars of Computation | 519.713 SHA A second course in formal languages and automata theory / | 519.713 SHA Theory of Automata and Formal Languaues |
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
There are no comments on this title.