Engineering
- Derive the state table and diagram for the following table
Current states next state
W x q s c
0 0 0 0 0
0 0 1 0 1
0 1 0 1 0
0 1 1 1 1
1 0 0 0 0
1 0 1 1 1
1 1 0 0 0
1 1 1 1 0
- Derive the state table and variables for the following circuit (by looking at the state transistor, determine what this circuit does)
Current State Next State
Qa Qb Qa Qb
0 0 0 1
0 1 1 0
1 0 1 1
1 1 0 0
1 1\1
1
- Starting from the state 00 in the following state diagram determine the state transition and output sequence for the following input sequence 010110111011110
n-th one detector, n=2
input: 010110111011110
output: 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0
n-th , n=3
Input: 0 0 1 0 0 1 1 1 0 1 1 0 0 1 0
Output: 0 0 0 0 0 0 1 0 0 0 1 0 0 0
011 pattern
Input: 0 0 1 0 0 1 1 1 0 1 1 0 0 1 0
Output: 0 0 0 0 0 0 1 0 0 0 1 0 0 0
1010 pattern
Input: 0 0 1 0 0 1 1 1 0 1 1 0 0 1 0
Output: 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Reduce the following state table
| ns | z | |||
| ps | X=0 | X=1 | X=0 | X=1 |
| c | f | e | 0 | 0 |
| D | g | a | 1 | 0 |
| F | f | b | 1 | 1 |
| G | g | h | 0 | 1 |
| h | g | a | 1 | 1 |
Starting from the state a, for the following input sequence ( 01110010011) determine the state transition and output for
- The original state table in problem 4
Current Next State
x=0 x= 1 x=0 x=1
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 1
0 0 1 1
0 1 0 0
1 0 0 0
- 1 0 1
- The reduced state table in problem 4
Current Next State
x=0 x= 1 x=0 x=1
0 1 1 0
1 0 1 0
1 1 1 1
0 0 1 1
1 0 0 0
1 1 0 1
