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: and one output Z . Given the following next-state table, use the triangular table provided below to minimize the number of states. b) Find the Maximal Class of Compatibility. Fill in as many groups as necessary. g0: g1: g2: g3: g4: g5: c) Based on the Maximal Class of Compatibility, define a minimum set of states that satisfies the covering and closure requirements. List the resulting state transitions and outputs in a table. Fill in as many rows of the table as necessary. 3. Text Book Problem 9.4 4. Text Book Problem 9.5...
View Full Document
This note was uploaded on 11/10/2010 for the course CSE 140 taught by Professor Rosing during the Spring '06 term at UCSD.
- Spring '06