Abstract
In the previous chapters we have seen that the solution of a unate covering problem appears as a key step both in the minimum selection of encoding dichotomies and in GPI minimization.
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
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Villa, T., Kam, T., Brayton, R.K., Sangiovanni-Vincentelli, A. (1997). Implicit Formulation of Unate Covering. In: Synthesis of Finite State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6155-2_10
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6155-2_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7821-1
Online ISBN: 978-1-4615-6155-2
eBook Packages: Springer Book Archive