Image from Amazon.com
Automata computability and complexity
Material type:
TextPublication details: New Delhi : Peason India Education, ©2012.Description: xx, 1099 p. : ill. (b&w) ; 24 cm (Paperback)ISBN: - 9788131788226
- 511.3 RIC / B
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Book
|
IIT - Dharwad | MAT | 511.3 RIC / B (Browse shelf(Opens below)) | Available | 620 |
Browsing IIT - Dharwad shelves Close shelf browser (Hides shelf browser)
|
|
No cover image available |
|
|
|
|
||
| 511.3 LI / B Mathematical logic : | 511.3 MAN / B A course in mathematical logic for mathematicians | 511.3 MAN / G Completeness, compactness and undecidability : an introduction to mathematical logic | 511.3 RIC / B Automata computability and complexity | 511.3 SAC / B Mathematical logic in the 20th century | 511.3 SIM / B Automata theory | 511.3 SMI / B An introduction to Godel's theorems |
Includes index,
There are no comments on this title.
Log in to your account to post a comment.