Switeching and Finite Automation Theory
Material type: TextPublication details: New Delhi Cambridge University Press 2010Edition: 3rdDescription: 617pISBN:- 9780521176804
- 511.35 KOH-S
Item type | Current library | Collection | Call number | URL | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Books | Amity Central Library ASET CSE | 511.35 KOH-S (Browse shelf(Opens below)) | Available | 29506 | ||||
Reference Book | Amity Central Library ASET CSE | Reference | 511.35 KOH-S (Browse shelf(Opens below)) | Link to resource | Not For Loan | 24898 | ||
Books | Amity Central Library ASET CSE | 511.35 KOH-S (Browse shelf(Opens below)) | Link to resource | Available | 24899 |
Preface; Part I. Preliminaries: 1. Number systems and codes; 2. Sets relations and lattices; Part II. Combinational Logic: 3. Switching algebra and its applications; 4. Minimisation of switching functions; 5. Logic design; 6. Multilevel logic synthesis; 7. Threshold logic for nanotechnologies; 8. Testing of combinational circuits; Part III. Finite State Machines: 9. Introduction to synchronous sequential circuits and iterative networks; 10. Capabilities minimisation and transformation of sequential machines; 11. Asynchronous sequential circuits; 12. Structure of sequential machines; 13. State-identification experiments and testing of sequential circuits; 14. Memory definiteness and information losslessness of finite automata; 15. Linear sequential machines; 16. Finite-state recognisers; Index.
There are no comments on this title.