Switching and Finite Automata Theory

Kohavi, Zvi

Switching and Finite Automata Theory - New Delhi: The Cambridge University, 2010. - ix,617p.

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.

9780521176804


Sequential machine theory.
Switching theory.
Logic design.

511.35 / KOH/S
SIKKIM UNIVERSITY
University Portal | Contact Librarian | Library Portal

Powered by Koha