Switching machines sequential systems von perrin (7 Ergebnisse)
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 61,10
EUR 13,99 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 80,10
EUR 14,60 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Paperback. Zustand: Brand New. 420 pages. 9.25x6.10x0.95 inches. In Stock.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 59,97
EUR 63,17 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - We shall begin this brief section with what we consider to be its objective. It will be followed by the main outline and then concluded by a few notes as to how this work should be used. Although logical systems have been manufactured for some time,…the theory behind them is quite recent. Without going into historical digressions, we simply remark that the first comprehensive ideas on the application of Boolean algebra to logical systems appeared in the 1930's. These systems appeared in telephone exchanges and were realized with relays. It is only around 1955 that many articles and books trying to systematize the study of such automata, appeared. Since then, the theory has advanced regularly, but not in a way which satisfies those concerned with practical applications. What is serious, is that aside the books by Caldwell (which dates already from 1958), Marcus, and P. Naslin (in France), few works have been published which try to gather and unify results which can be used by the practis ing engineer; this is the objective of the present volumes.
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 165,80
EUR 13,99 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 165,80
EUR 13,99 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 168,73
EUR 63,32 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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.
- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 233,88
EUR 14,60 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Paperback. Zustand: Brand New. 440 pages. 9.25x6.10x1.00 inches. In Stock.
