Autres éditions populaires du même titre
Résultats de recherche pour Switching Machines: Sequential Systems
Image d'archives
Perrin:Switching Machines (eng)
impression à la demandeVendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 4 sur 5 étoiles
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur DB6MY72XUL
Acheter neuf
EUR 126,26
Expédition à EUR 6,80
Expédition depuis Italie vers Etats-Unis
Expédition depuis Italie vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Switching Machines: Volume 2 Sequential Systems
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9789401028691_new
Acheter neuf
EUR 162,61
Expédition à EUR 13,83
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Switching Machines
Edité par
Springer Netherlands, 2011
ISBN 10 : 9401028699
ISBN 13 : 9789401028691
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 5830304
Acheter neuf
EUR 136,16
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Switching Machines
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 440. N° de réf. du vendeur 26142317157
Acheter neuf
EUR 199,16
Expédition à EUR 3,44
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Switching Machines | Volume 2 Sequential Systems
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Switching Machines | Volume 2 Sequential Systems | J. P. Perrin (u. a.) | Taschenbuch | xiv | Englisch | 2011 | Springer | EAN 9789401028691 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 105625404
Acheter neuf
EUR 141,20
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Switching Machines
Edité par
Springer Netherlands Okt 2011, 2011
ISBN 10 : 9401028699
ISBN 13 : 9789401028691
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -7/Synthesis of the Tables.- 7.1. Generalizations.- 7.1.1. Introduction.- 7.1.2. Review of a sequential system¿s general equations.- 7.1.3. Normal form of the hypotheses.- 7.2. Natural methods.- 7.2.1. Ginsburg method-first case.- 7.2.1.2. The method in the general case.- 7.2.2. Ginsburg method-second case.- 7.2.2.1. Introductory examples.- 7.2.2.2. General statement of the method.- 7.2.3. Aizerman¿s method.- 7.2.3.1. Introductory example.- 7.2.3.2. General statement of the Aizerman method.- 7.2.3.3. Other examples of application.- 7.2.4. Asynchronous machines-Moisil-Ioanin method.- 7.3. Algebraic methods-Notion of a regular expression.- 7.3.1. Introduction.- 7.3.2. The algebra of regular expressions.- 7.4. Gloushkov method.- 7.4.1. Generalizations. Indexation of regular expressions.- 7.4.2. Examples of synthesis starting from regular expressions.- 7.4.2.1. First example.- 7.4.2.2. Second example of synthesis by the Gloushkov method.- 7.4.3. Statement of the Gloushkov method.- 7.4.4. Application of regular expression to the synthesis of asynchronous systems.- 7.4.4.1. Representation of asynchronous controls in terms of regular expressions.- 7.4.4.2. Example of synthesis of an asynchronous system.- 7.5. Conclusion.- 7.A. Brzozowski method.- 7. A.1. Basic definitions. The derivative of a regular expression with respect to a sequence of unity length.- 7. A.2. Use of the derivative to obtain the table of a machine.- Exercises.- 8/Reduction of the Number of States in a Table.- 8.1. Introduction-Statement of the problem.- 8.2. Equivalence of states.- 8.3. Reduction of complete tables.- 8.3.1. Construction of the table of equivalent pairs.- 8.3.2. Grouping of equivalent pairs.- 8.3.3. Formation of the minimal flow table.- 8.3.4. Another example of the minimization of a table.- 8.4. Reduction of incomplete tables.- 8.4.1. Basic definitions.- 8.4.2. Determination of compatible pairs.- 8.4.3. Grouping compatible terms.- 8.4.4. Choice of the M.C. and construction of the minimal flow table.- 8.4.5. Second example of reduction of an incomplete flow table.- 8.4.6. Third example of reduction.- 8.5. Programming of flow table reduction on digital computers.- 8.6. Reduction of a phase table.- 8.6.1. Equivalent states-pseudo-equivalent states.- 8.6.2. Row merging.- 8.7. Application of the method of compatible pairs to asynchronous systems.- 8.7.1. Synthesis of the reduction by Huffman¿s method.- 8.7.2. Example of the reduction of an asynchronous sequential system.- 8.7.2.1. Reduction by the method of compatible pairs.- 8.7.2.2. Reduction by the Huffman method.- 8.8. Conclusion.- Exercises.- 9/Assignment of the Internal States (Asynchronous Sequential Systems).- 9.1. Introduction.- 9.1.1. Generalizations.- 9.1.2. Asynchronous systems.- 9.1.3. Introductory example.- 9.1.4. Diverse methods and solutions.- 9.2. Connected sets.- 9.2.1. Connected sets and sequences.- 9.2.2. Application to the problem of asynchronous assignment.- 9.3. Huffman numbers.- 9.4. The influence of essential connections on the density of the assignment table.- 9.5. Reduction of the system¿s number of connections.- 9.5.1. Example 1.- 9.5.2. Example 2.- 9.5.3. Example 3.- 9.5.4. General principles of the method.- 9.5.5. Case of tables having ¿don¿t cares¿.- 9.6. Creation of supplementary unstable states.- 9.6.1. Example 4.- 9.6.2. Example 5.- 9.6.3. Remarks about the method.- 9.7. Incomplete merging of the primitive phase table.- 9.8. General remarks about assignment.- 9.9. Assignments and universal circuits.- 9.9.1. Universal assignments.- 9.9.2. Circuit with 2s0 + 1 relays (assignment by 2 s0 + 1 variables).- 9.9.3. Circuits with one relay per row (assignment by one variable per row).- Exercises.- 10/Assignment of Internal States (Synchronous Systems).- 10.1. Introduction.- 10.2. Distinct assignments-valid assignments.- 10.3. Example of the different assignments of a same table.- 10.4. Assignment from adjacency study.- 10.5. General concepts concerning partitions.- 10.5.1. Relations of order, sums, products.- 10.5.2. Use of p.s.p. for assignment.- 10.6. Search for the p.s.p.- 10.6.1. Study of the pairs.- 10.6.2. Maximal partitions.- 10.7. Properties connected with partitions p.s.p.- 10.7.1. Systems having a 2 block p.s.p.- 10.7.2. Systems having p.s.p. of more than 2 blocks.- 10.8. Use of the p.s.p. in assignment.- 10.9. Decomposition of sequential machines.- 10.9.1. Definitions.- 10.9.2. Decomposition theorem.- 10.9.3. Examples.- 10.9.4. Remarks concerning circuit realization.- 10.10. Partition pairs.- 10.10.1. Definition.- 10.10.2. Properties and particular partitions.- 10.10.3. Method for finding partition pairs.- 10.10.4. Properties connected with partition pairs.- 10.10.5. Conclusion.- 10.11. Assignment of the uncompletely specified tables.- 10.12. Extension methods.- 10.12.1. Examples of application extension of a given flow table by adding equivalent states.- 10.12.2. Example 2.- 10.12.3. Important comments.- 10.13. Assignment of internal states by taking into account the output.- 10.14. Conclusion.- Exercises.- 11/Examples of Applications.- 11.1. Introduction.- 11.2. Applications on computers.- 11.2.1. Shift register-logical flip-flop.- 11.2.2. Algebraic binary adder-deducter.- 11.2.3. Transfer authorization from one register to another.- 11.2.4. Reduction of a microprogram¿s length.- 11.2.4.1. Statement of the problem.- 11.2.4.2. Generalizations-inputs, outputs, states.- 11.2.4.3. Application to the example.- 11.2.4.4. Points of interest.- 11.3. Sequentially controlled machines.- 11.3.1. Complex automaton.- 11.3.1.1. Preliminaries.- 11.3.1.2. Phase table.- 11.3.1.3. Conclusions.- 11.3.2. Sequential functioning in a cement¿s oven control.- 11.3.2.1. Statement of the problem.- 11.3.2.2. Definitions of the different quantities.- 11.3.2.3. Study of the sequential functioning.- 11.3.2.4. The problem put into equations.- 11.3.2.5. Note relative to the section.- 11.3.2. N° de réf. du vendeur 9789401028691
Acheter neuf
EUR 192,55
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image d'archives
Switching Machines
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 440. N° de réf. du vendeur 18142317167
Acheter neuf
EUR 206,53
Expédition à EUR 9,95
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Switching Machines
Edité par
Springer, Springer Okt 2011, 2011
ISBN 10 : 9401028699
ISBN 13 : 9789401028691
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -7/Synthesis of the Tables.- 7.1. Generalizations.- 7.2. Natural methods.- 7.3. Algebraic methods-Notion of a regular expression.- 7.4. Gloushkov method.- 7.5. Conclusion.- 7.A. Brzozowski method.- Exercises.- 8/Reduction of the Number of States in a Table.- 8.1. Introduction-Statement of the problem.- 8.2. Equivalence of states.- 8.3. Reduction of complete tables.- 8.4. Reduction of incomplete tables.- 8.5. Programming of flow table reduction on digital computers.- 8.6. Reduction of a phase table.- 8.7. Application of the method of compatible pairs to asynchronous systems.- 8.8. Conclusion.- Exercises.- 9/Assignment of the Internal States (Asynchronous Sequential Systems).- 9.1. Introduction.- 9.2. Connected sets.- 9.3. Huffman numbers.- 9.4. The influence of essential connections on the density of the assignment table.- 9.5. Reduction of the system's number of connections.- 9.6. Creation of supplementary unstable states.- 9.7. Incomplete merging of the primitive phase table.- 9.8. General remarks about assignment.- 9.9. Assignments and universal circuits.- Exercises.- 10/Assignment of Internal States (Synchronous Systems).- 10.1. Introduction.- 10.2. Distinct assignments-valid assignments.- 10.3. Example of the different assignments of a same table.- 10.4. Assignment from adjacency study.- 10.5. General concepts concerning partitions.- 10.6. Search for the p.s.p.- 10.7. Properties connected with partitions p.s.p.- 10.8. Use of the p.s.p. in assignment.- 10.9. Decomposition of sequential machines.- 10.10. Partition pairs.- 10.11. Assignment of the uncompletely specified tables.- 10.12. Extension methods.- 10.13. Assignment of internal states by taking into account the output.- 10.14. Conclusion.- Exercises.- 11/Examples of Applications.- 11.1. Introduction.- 11.2.Applications on computers.- 11.3. Sequentially controlled machines.- 11.4. Analysis of a system of electrical airplane generation.- Exercises.- 12/Linear Sequential Systems.- 12.1. Introduction.- 12.2. Review of algebra.- 12.3. Transition of linear sequential systems.- 12.4. General configurations of linear machines.- 12.5. Discrete Laplace transform.- 12.6. Study of linear systems by the discrete Laplace transform.- 12.7. Application.- 12.8. Conclusion.- Exercises.- 13/Theoretical Study of the Real Functioning of Binary Switching Elements-Non-Binary Switching Elements.- 13.1. Many-valued algebra.- 13.2. Ternary algebra and relay systems.- 13.3. Expression for a function defined in a set of p values.- 13.4. Characteristic equation of a relay.- 13.5. Analysis of relay systems.- 13.7. Multipositional contactors.- 13.8. Analysis of a multipositional contactor circuit ideal functioning.- 13.9. Minimization of the conductibility function of the commutators' circuits.- 13.10. Synthesis of relay circuits with ordinary contacts 400 13.10.1. Action of a switch A on a relay X.- 13.11. Lukasiewicz algebras and their applications.- 13.12. Conclusion.- Exercises.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 440 pp. Englisch. N° de réf. du vendeur 9789401028691
Acheter neuf
EUR 160,49
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Switching Machines
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Print on Demand pp. 440 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 135014842
Acheter neuf
EUR 221,16
Expédition à EUR 7,50
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Switching Machines : Volume 2 Sequential Systems
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 7/Synthesis of the Tables.- 7.1. Generalizations.- 7.1.1. Introduction.- 7.1.2. Review of a sequential system¿s general equations.- 7.1.3. Normal form of the hypotheses.- 7.2. Natural methods.- 7.2.1. Ginsburg method-first case.- 7.2.1.2. The method in the general case.- 7.2.2. Ginsburg method-second case.- 7.2.2.1. Introductory examples.- 7.2.2.2. General statement of the method.- 7.2.3. Aizerman¿s method.- 7.2.3.1. Introductory example.- 7.2.3.2. General statement of the Aizerman method.- 7.2.3.3. Other examples of application.- 7.2.4. Asynchronous machines-Moisil-Ioanin method.- 7.3. Algebraic methods-Notion of a regular expression.- 7.3.1. Introduction.- 7.3.2. The algebra of regular expressions.- 7.4. Gloushkov method.- 7.4.1. Generalizations. Indexation of regular expressions.- 7.4.2. Examples of synthesis starting from regular expressions.- 7.4.2.1. First example.- 7.4.2.2. Second example of synthesis by the Gloushkov method.- 7.4.3. Statement of the Gloushkov method.- 7.4.4. Application of regular expression to the synthesis of asynchronous systems.- 7.4.4.1. Representation of asynchronous controls in terms of regular expressions.- 7.4.4.2. Example of synthesis of an asynchronous system.- 7.5. Conclusion.- 7.A. Brzozowski method.- 7. A.1. Basic definitions. The derivative of a regular expression with respect to a sequence of unity length.- 7. A.2. Use of the derivative to obtain the table of a machine.- Exercises.- 8/Reduction of the Number of States in a Table.- 8.1. Introduction-Statement of the problem.- 8.2. Equivalence of states.- 8.3. Reduction of complete tables.- 8.3.1. Construction of the table of equivalent pairs.- 8.3.2. Grouping of equivalent pairs.- 8.3.3. Formation of the minimal flow table.- 8.3.4. Another example of the minimization of a table.- 8.4. Reduction of incomplete tables.- 8.4.1. Basic definitions.- 8.4.2. Determination of compatible pairs.- 8.4.3. Grouping compatible terms.- 8.4.4. Choice of the M.C. and construction of the minimal flow table.- 8.4.5. Second example of reduction of an incomplete flow table.- 8.4.6. Third example of reduction.- 8.5. Programming of flow table reduction on digital computers.- 8.6. Reduction of a phase table.- 8.6.1. Equivalent states-pseudo-equivalent states.- 8.6.2. Row merging.- 8.7. Application of the method of compatible pairs to asynchronous systems.- 8.7.1. Synthesis of the reduction by Huffman¿s method.- 8.7.2. Example of the reduction of an asynchronous sequential system.- 8.7.2.1. Reduction by the method of compatible pairs.- 8.7.2.2. Reduction by the Huffman method.- 8.8. Conclusion.- Exercises.- 9/Assignment of the Internal States (Asynchronous Sequential Systems).- 9.1. Introduction.- 9.1.1. Generalizations.- 9.1.2. Asynchronous systems.- 9.1.3. Introductory example.- 9.1.4. Diverse methods and solutions.- 9.2. Connected sets.- 9.2.1. Connected sets and sequences.- 9.2.2. Application to the problem of asynchronous assignment.- 9.3. Huffman numbers.- 9.4. The influence of essential connections on the density of the assignment table.- 9.5. Reduction of the system¿s number of connections.- 9.5.1. Example 1.- 9.5.2. Example 2.- 9.5.3. Example 3.- 9.5.4. General principles of the method.- 9.5.5. Case of tables having ¿don¿t cares¿.- 9.6. Creation of supplementary unstable states.- 9.6.1. Example 4.- 9.6.2. Example 5.- 9.6.3. Remarks about the method.- 9.7. Incomplete merging of the primitive phase table.- 9.8. General remarks about assignment.- 9.9. Assignments and universal circuits.- 9.9.1. Universal assignments.- 9.9.2. Circuit with 2s0 + 1 relays (assignment by 2 s0 + 1 variables).- 9.9.3. Circuits with one relay per row (assignment by one variable per row).- Exercises.- 10/Assignment of Internal States (Synchronous Systems).- 10.1. Introduction.- 10.2. Distinct assignments-valid assignments.- 10.3. Example of the different assignments of a same table.- 10.4. Assignment from adjacency study.- 10.5. General concepts concerning partitions.- 10.5.1. Relations of order, sums, products.- 10.5.2. Use of p.s.p. for assignment.- 10.6. Search for the p.s.p.- 10.6.1. Study of the pairs.- 10.6.2. Maximal partitions.- 10.7. Properties connected with partitions p.s.p.- 10.7.1. Systems having a 2 block p.s.p.- 10.7.2. Systems having p.s.p. of more than 2 blocks.- 10.8. Use of the p.s.p. in assignment.- 10.9. Decomposition of sequential machines.- 10.9.1. Definitions.- 10.9.2. Decomposition theorem.- 10.9.3. Examples.- 10.9.4. Remarks concerning circuit realization.- 10.10. Partition pairs.- 10.10.1. Definition.- 10.10.2. Properties and particular partitions.- 10.10.3. Method for finding partition pairs.- 10.10.4. Properties connected with partition pairs.- 10.10.5. Conclusion.- 10.11. Assignment of the uncompletely specified tables.- 10.12. Extension methods.- 10.12.1. Examples of application extension of a given flow table by adding equivalent states.- 10.12.2. Example 2.- 10.12.3. Important comments.- 10.13. Assignment of internal states by taking into account the output.- 10.14. Conclusion.- Exercises.- 11/Examples of Applications.- 11.1. Introduction.- 11.2. Applications on computers.- 11.2.1. Shift register-logical flip-flop.- 11.2.2. Algebraic binary adder-deducter.- 11.2.3. Transfer authorization from one register to another.- 11.2.4. Reduction of a microprogram¿s length.- 11.2.4.1. Statement of the problem.- 11.2.4.2. Generalizations-inputs, outputs, states.- 11.2.4.3. Application to the example.- 11.2.4.4. Points of interest.- 11.3. Sequentially controlled machines.- 11.3.1. Complex automaton.- 11.3.1.1. Preliminaries.- 11.3.1.2. Phase table.- 11.3.1.3. Conclusions.- 11.3.2. Sequential functioning in a cement¿s oven control.- 11.3.2.1. Statement of the problem.- 11.3.2.2. Definitions of the different quantities.- 11.3.2.3. Study of the sequential functioning.- 11.3.2.4. The problem put into equations.- 11.3.2.5. Note relative to the section.- 11.3.2.6. Conclusions. N° de réf. du vendeur 9789401028691
Acheter neuf
EUR 168,73
Expédition à EUR 63,32
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)