Design a fundamental mode asynchronous finite state machine that accepts input pair, A and B. The AB input sequence 00, 01,11, 1
0, 11, 01 is assumed. Z=1 output is produced on the last input (01) of the sequence.a. Develop the primitive flow table with a new stable state under each input for the giver sequence. For a given total stable state, assume other inputs (not in the sequence) are don't cares. b. Determine a reduced flow table to achieve the minimum number of feedback paths. c. Determine a state assignment for the feedback path(s) and show the reduced encoded flow table.
1 answer:
Answer:
See explaination
Explanation:
A Finite state machines can be synchronous or asynchronous. The operation of asynchronous state machines does not require a clock signal. An Asynchronous state machine is classified basically on their operating mode, such as the fundamental mode, pulse mode or burst mode. An asynchronous state machine can have stable and transient states.
Please kindly refer to attachment for a step by step solution.
You might be interested in
Answer:
Option (d) 2 min/veh
Explanation:
Data provided in the question:
Average time required = 60 seconds
Therefore,
The maximum capacity that can be accommodated on the system, μ = 60 veh/hr
Average Arrival rate, λ = 30 vehicles per hour
Now,
The average time spent by the vehicle is given as
⇒
thus,
on substituting the respective values, we get
Average time spent by the vehicle =
or
Average time spent by the vehicle =
or
Average time spent by the vehicle =
or
Average time spent by the vehicle = hr/veh
or
Average time spent by the vehicle = min/veh
[ 1 hour = 60 minutes]
thus,
Average time spent by the vehicle = 2 min/veh
Hence,
Option (d) 2 min/veh