Finite automata formal logic and circuit complexity
Material type:
TextLanguage: English Series: Progress in theoretical computer sciencePublication details: Boston Birkhauser 1994Description: xii,226pISBN: - 0-8176-3719-2
- 511.3 St912
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 511.3 St912 (Browse shelf(Opens below)) | Available | 114586 | |||
| Books | ISI Library, Kolkata | 511.3 St912 (Browse shelf(Opens below)) | Available | PC34 |
Total holds: 0
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | ||||
| 511.3 St849 Automation theory and learning systems | 511.3 St875 Sets,logic,and axiomatic theories | 511.3 St912 Finite automata formal logic and circuit complexity | 511.3 St912 Finite automata formal logic and circuit complexity | 511.3 St933 Equivalents of the axiom of choice | 511.3 St933(1) Solvable cases of the decision problem | 511.3 St933(10) Propositional logic of boethius |
There are no comments on this title.
Log in to your account to post a comment.
