This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: rather than combinational in nature. c) Obtain the primitive flow map. d) Obtain a reduced flow map using a minimum set of mergeable states, and assign a single state name to each group of merged states. 4) Obtain a universal race-free state assignment code for any asynchronous fundamental mode machine with four stable states. Show that the proposed state assignment is universal (all stable states have adjacent codes) by drawing the state assignment code map....
View Full Document
- Spring '10