Abstract
In Chapters 6, 7, 8, the synthesis of a sequential machine was performed from imposed specifications and a simple form of representation (the most compact form possible) was obtained by reduction processes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Huffman, D. A., ‘The Synthesis of Sequential Switching Circuits’, Franklin Institute 257(1954).
Caldwell, S. H., Switching Circuits and Logical Design, Wiley, New York, U.S.A., 1958, pp. 524–72.
Huffman, D. A., ‘A Study of the Memory Requirements of Sequential Switching Circuits’, Technical J. Rep. 293, Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, Mass., U.S.A., 1955.
Marcus, M. P., Switching Circuits for Engineers, Prentice Hall, Englewood Cliff, N.J., U.S.A., 1962.
Elsey, J., ‘An Algorithm for the Synthesis of Large Sequential Switching Circuits’, Report R. 169, Coordinated Science Laboratory, University of Illinois, Urbana, 111., U.S.A.
Galimberti. R. and Morpurgo, R. M., ‘Une methode heuristique pour le codage des etats secondaires dans les réseaux séquentiels asynchrones’, in Algébre de Boole et machines logiques (ed. by P. Naslin and J. Kuntzman ), Dunod, Paris, 1966.
Saucier, G., ‘Etude des conages des tableaux d’etat des systemes sequentiels asynchrones’, in Algebre de Boole et machines logiques (ed. by P. Naslin and J. Kuntzman ), Dunod, Paris, 1966.
Naslin, P., an Kuntzman, J., Algebre de Boole et machines logiques, Dunod, Paris, 1967.
Rights and permissions
Copyright information
© 1972 D. Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Perrin, JP., Denouette, M., Daclin, E. (1972). Assignment of the Internal States (Asynchronous Sequential Systems). In: Switching Machines. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-2867-7_3
Download citation
DOI: https://doi.org/10.1007/978-94-010-2867-7_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-2869-1
Online ISBN: 978-94-010-2867-7
eBook Packages: Springer Book Archive