Image from Amazon.com
Finite automata, formal logic, and circuit complexity
Material type:
TextSeries: Progress in Theoretical Computer sciencePublication details: Boston : Birkhauser, ©1994.Description: xii, 226 p. : ill. ; 25 cm (Hardbound)ISBN: - 9780817637194
- 511.3 STR / B
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Book
|
IIT - Dharwad | MAT | 511.3 STR / B (Browse shelf(Opens below)) | Costly Reference | 1419 |
Browsing IIT - Dharwad shelves Close shelf browser (Hides shelf browser)
|
|
|
|
No cover image available |
|
|
||
| 511.3 SMI / B An introduction to Godel's theorems | 511.3 SMI / DST An introduction to Godel's theorems | 511.3 SMU / B Gödel's incompleteness theorems | 511.3 STR / B Finite automata, formal logic, and circuit complexity | 511.3 USP / G Gödel's incompleteness theorem | 511.3 WIG / B Mathematics and computation: | 511.3 WIG / B Mathematics and computation: |
Includes index,
There are no comments on this title.
Log in to your account to post a comment.