1
00:00:01,640 --> 00:00:02,900
In the previous lectures.

2
00:00:03,850 --> 00:00:07,660
We designed a few sequential circuits using Etchells design flaw.

3
00:00:08,260 --> 00:00:12,710
The question is, how can we formally describe sequential circuits in each of us?

4
00:00:13,600 --> 00:00:20,110
This letter will explain the Phoenix State Machine FSM concept, a formula approach to model a sequential

5
00:00:20,110 --> 00:00:20,440
circuit.

6
00:00:23,010 --> 00:00:29,220
The finite state machine FSM is a modelling technique representing the sequence of events in an algorithm.

7
00:00:30,510 --> 00:00:37,650
If an application consists of a list of well defined tasks which determine all the possible state transitions

8
00:00:37,770 --> 00:00:44,760
and design outputs in terms of all input combinations, then FSM can be used to describe the.

9
00:00:45,640 --> 00:00:53,890
Examples of such applications include digital controllers, timer's counters, sequence finders, protocol,

10
00:00:53,890 --> 00:00:59,590
processing display drivers, estaba motor drivers, signal generators.

11
00:01:00,640 --> 00:01:07,360
Surreal communications circuits such as Miles and I, to see drivers, washing machine controllers,

12
00:01:07,660 --> 00:01:10,060
robot controllers, just to name a few.

13
00:01:13,200 --> 00:01:19,830
As they transition diagram can represent an officer, let's consider a combination lock that only accept

14
00:01:19,830 --> 00:01:27,240
the sequence of two, three, four and six to unlock this behavior can be modeled by a state transition

15
00:01:27,240 --> 00:01:27,680
graph.

16
00:01:27,900 --> 00:01:32,670
First, we are at the risk of state and zero waiting to receive the first digit.

17
00:01:33,540 --> 00:01:39,930
If digit two is pressed, then the controller goes to state as two and the door is still locked.

18
00:01:40,350 --> 00:01:44,760
Entering any other numbers, the controller will stay in the recent state.

19
00:01:46,640 --> 00:01:53,180
If it is to the controller receives three, then it goes to a state as two, three and the door is closed,

20
00:01:53,180 --> 00:01:57,410
entering any other numbers resets the controller to state as zero.

21
00:01:59,510 --> 00:02:05,900
Even as two three state, the controller receives four, then it goes to a state as two, three, four

22
00:02:06,110 --> 00:02:11,810
and the door is closed, entering any other numbers resets the controller to state a zero.

23
00:02:13,180 --> 00:02:19,330
If it as two, three, four state, the controller received six, then it goes to state s two, three,

24
00:02:19,330 --> 00:02:21,870
four, six and the door will be opened.

25
00:02:24,930 --> 00:02:30,920
What are the essential elements of a finite state machine, the next lecture will answer this question.

26
00:02:34,610 --> 00:02:41,180
These are our takeaway messages, a finite state machine, FSM can model an application with the least

27
00:02:41,180 --> 00:02:48,470
of well-defined tasks as they transition diagram can represent an FSM, which later will be turned to

28
00:02:48,470 --> 00:02:49,910
the equivalent Etchells Kote.

29
00:02:52,440 --> 00:02:53,490
Now the question.

30
00:02:54,860 --> 00:03:01,670
Draw the state transition diagram of a combination lock that needs the sequence of one four five two

31
00:03:01,670 --> 00:03:02,930
five to open.