In the previous lectures.
We designed a few sequential circuits using Etchells design flaw.
The question is, how can we formally describe sequential circuits in each of us?
This letter will explain the Phoenix State Machine FSM concept, a formula approach to model a sequential
circuit.
The finite state machine FSM is a modelling technique representing the sequence of events in an algorithm.
If an application consists of a list of well defined tasks which determine all the possible state transitions
and design outputs in terms of all input combinations, then FSM can be used to describe the.
Examples of such applications include digital controllers, timer's counters, sequence finders, protocol,
processing display drivers, estaba motor drivers, signal generators.
Surreal communications circuits such as Miles and I, to see drivers, washing machine controllers,
robot controllers, just to name a few.
As they transition diagram can represent an officer, let's consider a combination lock that only accept
the sequence of two, three, four and six to unlock this behavior can be modeled by a state transition
graph.
First, we are at the risk of state and zero waiting to receive the first digit.
If digit two is pressed, then the controller goes to state as two and the door is still locked.
Entering any other numbers, the controller will stay in the recent state.
If it is to the controller receives three, then it goes to a state as two, three and the door is closed,
entering any other numbers resets the controller to state as zero.
Even as two three state, the controller receives four, then it goes to a state as two, three, four
and the door is closed, entering any other numbers resets the controller to state a zero.
If it as two, three, four state, the controller received six, then it goes to state s two, three,
four, six and the door will be opened.
What are the essential elements of a finite state machine, the next lecture will answer this question.
These are our takeaway messages, a finite state machine, FSM can model an application with the least
of well-defined tasks as they transition diagram can represent an FSM, which later will be turned to
the equivalent Etchells Kote.
Now the question.
Draw the state transition diagram of a combination lock that needs the sequence of one four five two
five to open.