---
###### tags: `SCLD`
---
# Chap 15 Reduction of State Tables State Assignment
## 15.1 Elimination of Redundant States
example from [14.3](https://hackmd.io/LXOP-VITQvud6TBSDE25uA?both#143-Guidelines-for-Construction-of-State-Graphs)
The circuit examines groups of four consecutive inputs and produces an output Z = 1 if the input sequence 0101 or 1001 occurs. The circuit resets after every four inputs.

4 bit → reset → A
H → next state A, output 0
I → next state A, output 0
so eliminate I
畫出同 14.3 的圖

## 15.2 Equivalent States

## 15.3 Determination of State Equivalence Using an Implication Table
example
x & y 相等的條件
不可能 → 打叉
多餘的 → 劃掉
(d,f) 打叉 → (a,b)不可能 → (a,b) 打叉
一樣

## 15.4 Equivalent Sequential Circuits
兩張圖比較，做 implication table

## Problems
#### 15.10(b)
ans

#### 15.11(b)
ans

#### 15.12
ans

#### 15.17
ans

#### 15.35
這 15.9 的
不會考
ans

#### 15.40
ans