Abstract
This chapter presents Optimist, a novel method for state minimization of incompletely-specified finite state machines [61]. Where classic methods simply minimize the number of states, this method directly addresses the implementation’s logic complexity.
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
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fuhrer, R.M., Nowick, S.M. (2001). OPTIMIST: Optimal State Minimization for Synchronous FSM’s. In: Sequential Optimization of Asynchronous and Synchronous Finite-State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1417-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1417-6_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5543-4
Online ISBN: 978-1-4615-1417-6
eBook Packages: Springer Book Archive