Abstract
In the preceding chapter a first analysis showed that the main property characterizing sequential systems is the existence of memory functions which we specified in the form of internal states.
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
MOORE, E. F., ‘Gedanken Experiments on Sequential machines’, Automata Studies, Princeton University Press, 1956.
MEALY, G. M., ‘A Method for Synthetizing Sequential Circuits’, Bell System Technical J. 34(1955) 1045–79.
CADDEN, W. J., ‘Equivalent Sequential Circuits’, IRE Trans. Circuits Theory C.T. 6 (1959) 30–34.
GILL, A., ‘Comparison of Finite State Models’, IRE Trans. Circuits Theory C.T. 7(1960) 178–72.
AIZERMAN, M. A., GOUCER, L. A., SMIRNOVA, I. M., TAL, A. A., And ROZONOER, L. I., Logique, automates, algorithmes, Phys. Math., Éditions d’état, Moscou, 1963.
GLOUSHKOV, V. M., ‘Théorie abstraite des automates’, Ann. roumaines-soviétiques, Math. Phys. 2(1962).
GILL, A., Introduction to the Theory of Finite-state machines, McGraw-Hill, New York, 1962.
FLORINE, J., La synthèse des machines logiques, Presses Académiques Européennes, Bruxelles, Dunod, Paris, 1964.
BRUNIN, S., Logique binaire et communications, Dunod, Paris, 1966.
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). Representation and Classification of Sequential Systems. In: Switching Machines. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-2864-6_5
Download citation
DOI: https://doi.org/10.1007/978-94-010-2864-6_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-2866-0
Online ISBN: 978-94-010-2864-6
eBook Packages: Springer Book Archive