Abstract
As we have pointed out in the Introduction, the first practical application of Boolean algebras was given to the theory of switching circuits. Since there exists a wide literature on switching algebra, we have omitted this field in our book, with two exceptions. The first one is the description, in Chapter IX, § 8, of Luno’s methods for solving the analysis and synthesis problems in case of multi-terminal switching circuits. The second exception is the present chapter, where we shall describe a bivalent mathematical programming approach to certain minimization problems occuring in switching theory.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1968 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hammer, P.L., Rudeanu, S. (1968). Minimization Problems in Automata Theory. In: Boolean Methods in Operations Research and Related Areas. Ökonometrie und Unternehmensforschung / Econometrics and Operations Research, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85823-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-85823-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85825-3
Online ISBN: 978-3-642-85823-9
eBook Packages: Springer Book Archive