Switching and Finite Automata Theory
Material type: TextPublication details: New Delhi: The Cambridge University, 2010Description: ix,617pISBN: 9780521176804Subject(s): Sequential machine theory | Switching theory | Logic designDDC classification: 511.35Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
General Books | Central Library, Sikkim University General Book Section | 511.35 KOH/S (Browse shelf(Opens below)) | Available | 050805 |
Browsing Central Library, Sikkim University shelves, Shelving location: General Book Section Close shelf browser (Hides shelf browser)
511.313 ROS/F Fuzzy Logic with Engineering Applications/ | 511.322 DEV/J The joy of sets/ | 511.326 BAE/L Latent variable modeling using R/ | 511.35 KOH/S Switching and Finite Automata Theory | 511.35 SIP/I Introduction to the Theory of Computation, | 511.352 GAR/I Introduction to Elementary Computational Modeling/ | 511.352 NIE/Q Quantum computation and quantum information/ |
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. Minimization 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, minimization, 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.