Abstract
We have seen how language equations can be solved by manipulating automata or FSMs, and that a largest solution can be obtained in terms of a deterministic automaton. If the solution is required as a finite state machine, then the solution can be made prefix-closed and (input)-progressive. At this point, we have the largest (non-deterministic, in general) FSM solution which contains all possible deterministic FSMs that are a solution; usually a deterministic FSM solution can be obtained by selecting a submachine of the largest solution. In some problems, it is enough to know that a solution exists and any one solution will be adequate. In other problems, we want a solution which can be implemented in an efficient way, say with small area, or power or delay.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Two states are immediately equivalent if for any input, they produce the same output and go to the same next state.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Villa, T., Yevtushenko, N., Brayton, R.K., Mishchenko, A., Petrenko, A., Sangiovanni-Vincentelli, A. (2012). Exploitation of Flexibility in Sequential Networks. In: The Unknown Component Problem. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-68759-9_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-68759-9_14
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34532-1
Online ISBN: 978-0-387-68759-9
eBook Packages: EngineeringEngineering (R0)