Switching Machines: Volume 1: Combinational Systems Introduction to Sequential Systems
Autor J.P. Perrin, M. Denouette, E. Daclinen Limba Engleză Paperback – 9 oct 2011
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 338.49 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 9 oct 2011 | 338.49 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 13 oct 2011 | 994.08 lei 6-8 săpt. | |
Hardback (1) | 1000.50 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 30 iun 1972 | 1000.50 lei 6-8 săpt. |
Preț: 338.49 lei
Preț vechi: 423.11 lei
-20% Nou
Puncte Express: 508
Preț estimativ în valută:
64.78€ • 67.24$ • 54.01£
64.78€ • 67.24$ • 54.01£
Carte tipărită la comandă
Livrare economică 22 martie-05 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789401028660
ISBN-10: 9401028664
Pagini: 420
Ilustrații: 416 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:Softcover reprint of the original 1st ed. 1972
Editura: SPRINGER NETHERLANDS
Colecția Springer
Locul publicării:Dordrecht, Netherlands
ISBN-10: 9401028664
Pagini: 420
Ilustrații: 416 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:Softcover reprint of the original 1st ed. 1972
Editura: SPRINGER NETHERLANDS
Colecția Springer
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
1/Boolean Algebra.- 1.1. Introduction.- 1.2. Binary number systems—codes.- 1.3. Postulates and theorems of Boolean algebra.- 1.4. Boolean functions.- 1.5. Reduction of Boolean functions—Map representation.- 1.6. Reduction of Boolean functions (continued)—McCluskey-Quine method.- 1.7. Reduction of functions containing ‘don’t care’ terms.- 1.8. Factorization of Boolean functions.- 1.9. Conclusions.- Appendixes.- Exercises.- 2/Practical Realization of Logical Functions.- 2.1. Introduction.- 2.2. Elementary notions.- 2.3. The relay.- 2.4. Electronic circuits—Positive and negative logics.- 2.5. Diode circuits.- 2.6. Transistor circuits.- 2.7. Flip-flop and memory transistorized logics.- 2.8. Tunnel Diodes.- 2.9. Magnetic circuits.- 2.10. Cryotrons.- 2.11. Fluidic logic.- 2.12. Integrated circuits.- 2.13. Logical simulators.- Exercises.- 3/Combinational Systems.- 3.1. Introduction.- 3.2. Boolean algebra and technology.- 3.3. Combinational systems.- 3.4. Combinational dipoles.- 3.5. Study of combinational multipoles.- 3.6. Matrix analysis of combinational relay systems.- 3.7. Comparison between the general simplification method of Boolean functions and the matrix analysis method in relay systems.- Exercises.- 4/Introduction to Sequential Systems.- 4.1. Review of the general properties of transient phenomena in combinational Systems.- 4.2. Sequential systems—Analysis.- 4.2.5. Performance of a sequential system.- 4.3. Synthesis problems—Definitions of the internal state.- 4.4. Internal state—Technological state.- 4.5. Conclusion.- Appendix—Physical interpretation of the choice of internal variables.- Exercises.- 5/Representation and Classification of Sequential Systems.- 5.1. Introduction.- 5.2. Flow table of a sequential system.- 5.3. Asynchronous andsynchronous machines.- 5.4. Moore, Mealy, and Huffman machines.- 5.5. Complementary notions.- Exercises.- 6/Analysis of Sequential Systems Hazards in Sequential and Combinational Systems.- 6.1. Analysis of asynchronous sequential systems.- 6.2. Analysis of synchronous sequential systems.- 6.3. Hazards in combinational and sequential systems.- 6.4. Hazards in asynchronous sequential systems.- 6.5. Hazards in synchronous systems.- Exercises.