Abstract
In control research, two large classes can be distinguished. In one we deal with quantities which can take an infinity of values such as servomechanisms (linear, non-linear or sampled). The classical example of a servomechanism is an automatic airplane pilot. The input signals are the different parameters of the airplane and the exterior parameters. Their variations, for the most part, are continuous. The output signals are, for example, the airplane’s speed and direction which also vary continuously within a certain domain of values.
This is a preview of subscription content, log in via an institution to check access.
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
QUINE, W. V., ‘A Way to Simplify Truth Functions’, Am. Math. Monthly 66 (1955) 627–31.
QUINE, W. V., ‘On Cores and Prime Implicants of Truth Functions’, Am. Math. Monthly 66 (1959) 755–60.
MCCLUSKEY, E. J., ‘Minimization of Boolean Functions’, Bell System Technical J. 35(1956) 1417–44.
Staff of the Harvard Computation Laboratory, Annals of the Computation Laboratory in Synthesis of Electronic Computing and Control Circuits, vol. 27, Harvard University Press, Cambridge, Mass.
CALDWELL, S. H., Switching Circuits and Logical Design, Wiley, New York, 1958.
KARNAUGH, M., ‘The Map Method for Synthesis of Combinational Logic Circuits, Communication and Electronic’, Trans. A.l.E.E. part I, vol. 72,1953.
VEITCH, E. W., ‘Third and Higher Order Minimal Solutions of Logical Equations’, in Symposium d’algèbre des circuits logiques, I.C.I.P, Paris, 1960.
MCCLUSKEY, E. J. and BARTEE, T. C., A Survey of Switching Circuit Theory, McGraw-Hill, New York, 1962.
CURTIS, M. A., A New Approach to the Design of Switching Circuits, Van Nostrand, 1962.
BOOLE, G., The Mathematical Analysis of Logic, Cambridge, 1847.
ASHENHURST, R. L., ‘The Decomposition of Switching Functions’, Harvard Computation Laboratory, Bell Laboratories’ Report No. BL-1 (II), 1952.
TISON, P., ‘Recherche de termes premiers d’une fonction booléenne’, Automatisme 9(1964) No. 1.
TISON, P., ‘Théorie des consensus et algorithmes de recherche des bases premières’, in Colloque d’algèbre de Boole, Grenoble, 1965.
TISON, P., ‘Algèbre booléenne: théorie des consensus. Recherche des bases premières d’une fonction booléenne’, Automatisme 10 (1965) No. 6.
PANDEFF, E., ‘Calcul matriciel booléen’, in Colloque d’algèbre de Boole, Grenoble, 1965.
LEDLEY, R. S., Digital Computer and Control Engineering, McGraw-Hill, New York, 1960.
PHISTER, M., Logical Design of Digital Computers, Wiley, New York, 1961.
FLORINE, J., La synthèse des machines logiques, Dunod, Paris, et Presses Académiques Européennes, Bruxelles, 1964.
NASLIN, P. and KUNTZMAN, J., Algèbre de Boole et machines logiques, Dunod, Paris, 1966.
NASLIN, P., Circuits logiques et automatismes à séquences, Dunod, Paris, 1965.
KAUFFMANN, A., DENIS PAPIN, M., and FAURE, R., Calcul booléen appliqué, Albin Michel, Paris, 1962.
BARTEE, T. C., LEBOV, I. L., and REED, I. S., Theory and Design of Digital Machines, McGraw-Hill, New York, 1962.
HUMPHREY, W. S., Switching Circuits with Computer Applications, McGraw- Hill, New York, 1958.
BRUNIN, J., ‘Simplification des fonctions logiques à grand nombre de variables’, Automatisme 5 (Juillet 1963).
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). Boolean Algebra. In: Switching Machines. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-2864-6_1
Download citation
DOI: https://doi.org/10.1007/978-94-010-2864-6_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-2866-0
Online ISBN: 978-94-010-2864-6
eBook Packages: Springer Book Archive