Scribd
Upload
31 views6 pages

Asynchronous Sequential State Machine

This document provides instructions for drawing an asynchronous sequential state machine flow table for a circuit with two inputs (x1 and x2) and one output (z). It begins with the problem description and initial conditions. Then, it lists 7 rules for completing the state table, such as starting with an initial stable state of 0, representing unstable states with numbers corresponding to their row placement, and only changing one input at a time. Finally, it begins the solved state table with the 4 possible input combinations as column headers and shows the first step of the solution.

Uploaded by

Abhishek Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views6 pages

Asynchronous Sequential State Machine

This document provides instructions for drawing an asynchronous sequential state machine flow table for a circuit with two inputs (x1 and x2) and one output (z). It begins with the problem description and initial conditions. Then, it lists 7 rules for completing the state table, such as starting with an initial stable state of 0, representing unstable states with numbers corresponding to their row placement, and only changing one input at a time. Finally, it begins the solved state table with the 4 possible input combinations as column headers and shows the first step of the solution.

Uploaded by

Abhishek Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

State Table Problems in

Asynchronous Sequential
State Machine
- Abhishek Singh
Q.1 Draw the asynchronous sequential state
machine flow table for a circuit having two inputs x1
and x2 and an output z. Initially, x1 = x2 = z = 0. The
output becomes 1 when either of the input becomes
1. When both inputs becomes 1, the output becomes
0. For all other cases output becomes 0.
Rules to remember (Not to write in exam)
1. The initial state is always considered as Stable State with output zero. It is
also termed as reset state. It is written as,

Initial State 1 , 0 Initial Output

2. The unstable state is written without circle.


3. In any row, there will be only one stable state.
4. Both inputs cannot be changed simultaneously. This transition is written with a
dash sign.
5. When a transition is done from a stable state, first it’s unstable state is written
and then the stable state is written in that column.
6. The number used to represent unstable state is also the number of row on
which it’s stable state has to be written. For example, if unstable state is 2, then
it’s stable state will be written in 2nd row. If number is 3, then, stable state will be
written in row 3. It will look like this,

1 , 0 2 3

------
1 2 , 0
------
1 3 , 0
7. In any column if the desired output is already achieved, then there is no need to
write a new state. Let’s start solving our example.

x1x2 = 00 01 11 10

1
1 ,0 2 --- 3

2
1 2 ,1 4 ---
3
1 --- 4 3 ,1
4
--- 2 4 ,0 3
Stepwise Input Transition
Step 1: 00 to 01

Step 2: 00 to 10

Step 3: 01 to 11

Step 4: 10 to 11

Step 5: 11 to 01

Step 6: 11 to 10

You might also like