Switching and Finite Automata TheoryTata 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. |
Inhalt
Number Systems and Codes | 3 |
Chapter 2 | 24 |
Switching Algebra and Its Applications | 41 |
Urheberrecht | |
23 weitere Abschnitte werden nicht angezeigt.
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
algebra applied assignment block cell clock closed partitions code word column complement component computation Consequently consists contains corresponding covered decomposition defined denoted detect determine diagram digits distinguishing sequence entries equal equivalence partition equivalent error example finite finite-state machine flip-flop flow table full adder gate identical implication graph initial input combination input sequence input symbol linear machine logical equations machine M₁ matrix Mealy machine minimal expression minterms Moore machine next-state obtain operation output sequence partition pair path prime implicants procedure produces pulse realization reduced regular expression sequential circuit sequential machine shown in Fig shown in Table specified SR flip-flop subcubes subset sum-of-products switching circuits switching function symmetric functions synchronous synchronous circuit synthesis T₁ terminal theorem threshold element threshold function tion truth table variables vector vertex vertices x₁ Y₁