Switching and Finite Automata Theory

Tata McGraw-Hill, 1978 - 658 Seiten
Number systems and codes; Sets, relations and lattices; Combinational logic; Switching algebra its applications; Minimization of switching functions; Logical design; Functional decomposition and symmetric functions; Threshold logic; Reliable design and fault diagnosis; Finite-state machines; Introduction to synchronous sequential circuits and iterative networks; Capabilities, minimization and transformation of sequential machines; Asynchronous sequential circuits; Structure of sequential machines; Statae-identification and fault-detection experiments; Memory, definiteness, and information losslessness of finite automata; Linear sequential machines; Finite-state recognizers; Index.

Was andere dazu sagen - Rezension schreiben

Es wurden keine Rezensionen gefunden.

Andere Ausgaben - Alle anzeigen

Bibliografische Informationen