WEBVTT

00:00.060 --> 00:04.020
So now what we'll do is we'll transform our two state.

00:05.920 --> 00:08.380
Or to process meterology with a single person.

00:09.700 --> 00:13.180
And here now, since we only have a single process.

00:13.420 --> 00:15.940
OK, so we do not require two very well for us.

00:16.180 --> 00:17.710
This is an important point to note.

00:17.890 --> 00:23.290
OK, we will just as we move next year to as soon as we remove next year, it will start to get a whole

00:23.290 --> 00:24.070
lot of arrests.

00:24.670 --> 00:29.120
And now we understood that that is the point where we need to make change.

00:29.440 --> 00:30.190
So here.

00:31.190 --> 00:33.500
Now we need to remove this line, OK?

00:33.520 --> 00:37.770
Remember that now we are converting an entire code into a single process, right?

00:38.120 --> 00:45.170
So if reset is when the seat should be predominant, is zero else, OK, will be working on the case.

00:45.200 --> 00:48.410
OK, so El's Keys state is.

00:49.890 --> 00:52.280
OK, and then we'll just try to speak.

00:53.160 --> 00:58.490
OK, so then we have Aniceto, right, this is our state.

00:58.500 --> 01:01.840
We'll just copy this entire thing with this piece to here.

01:03.150 --> 01:07.670
OK, so when we have an extra.

01:08.840 --> 01:10.070
In that case.

01:12.060 --> 01:13.740
So I'm just selling it properly.

01:13.950 --> 01:21.450
OK, so in that case, if is when the state should be updated with this one else state should be remaining

01:21.450 --> 01:22.440
at SC, right.

01:22.980 --> 01:25.780
So this is what we want to do when we are necesito.

01:26.030 --> 01:29.690
OK, then we can just copy this entire thing again.

01:31.520 --> 01:31.970
OK.

01:33.940 --> 01:35.520
We'll just be straight with you, Ray.

01:38.000 --> 01:40.440
And here will just replace Nick Street with Street.

01:42.740 --> 01:43.190
This will be.

01:43.880 --> 01:47.960
And finally, when others will just copy ducting also.

01:49.670 --> 01:52.040
And then what will do is.

01:53.120 --> 01:56.390
Here also will take place next week with the state.

01:57.300 --> 02:03.240
OK, and then this completes everything that we have to guess, what we did is we first thing that we

02:03.240 --> 02:10.530
have noticed since we do not have any independent process for the next, so we merge the entire thing

02:10.530 --> 02:11.070
to a state.

02:11.340 --> 02:15.970
So we have removed an extra and that we choose a point where we need to make it right.

02:16.350 --> 02:23.850
And then we just copied the logic that we have written in the next logical and we have implemented a

02:24.120 --> 02:25.270
two person methodology.

02:25.560 --> 02:29.500
Finally, we need to Anakie states will distained.

02:29.540 --> 02:29.940
Ducky.

02:30.000 --> 02:30.630
So you.

02:32.650 --> 02:36.530
And then will be ending to a Friday.

02:36.570 --> 02:38.950
So there are two if so, we'll just and.

02:41.220 --> 02:47.830
And if they can finally be required and in process, right, just right, and then proceed with this

02:47.850 --> 02:53.720
complete single process methodological, and then we are ready to delete this entire process.

02:53.730 --> 02:54.000
Right.

02:54.660 --> 02:59.650
So what we did is if we're writing a clock, if research is one, then streets should be OK.

02:59.730 --> 03:04.710
And depending on the value of speed, we are deciding what should be the next state as well as what

03:04.710 --> 03:06.050
should be the value of the contract.

03:06.090 --> 03:11.080
So we'll just see Rockwool and we'll see whether the codes still work as expected.

03:13.080 --> 03:17.130
So now what we'll do is we'll just lose an existing simulation that we have.

03:18.150 --> 03:24.810
OK, and then we'll just perform a simulation, so let me just go ahead and perform a behavioral simulation

03:24.810 --> 03:25.380
when ciggie.

03:27.950 --> 03:29.260
OK, well, food supply.

03:32.600 --> 03:34.160
Will supply visit.

03:36.530 --> 03:43.010
We'll try to execute a simulation, so we'll be finding that we are Aniceto will remove you set by applying

03:43.010 --> 03:46.580
a zero and will force to be equal to one.

03:47.000 --> 03:49.040
OK, here we are expecting the square.

03:49.460 --> 03:49.770
Right.

03:50.060 --> 03:54.310
And now you can actually see that we are still getting a square with.

03:54.390 --> 03:54.800
Right.

03:56.210 --> 04:02.090
So now we have discussed how we can implement three processes, methodology to process the methodology

04:02.090 --> 04:03.770
in a single process methodology.

04:03.800 --> 04:08.590
OK, so the takeaway point is that output depends on both state as well as an input.

04:08.600 --> 04:10.310
Hence, this is a right.

04:10.520 --> 04:16.910
And we also understood what are the three different support that you need to implement to have a correct

04:16.940 --> 04:18.160
deficit right now.

04:18.200 --> 04:24.140
You also follow along and try to observe the same result if you are able to understand this process

04:24.350 --> 04:27.830
transiting towards some graphs and becomes very, very easy.

04:27.860 --> 04:34.690
OK, so we'll consider this and then we'll try to implement air traffic controller, the sequence detector.

04:34.700 --> 04:40.310
So you have an overall picture of an efficient and in fact, you'll be finding that it is very easy

04:40.310 --> 04:41.680
to work around with an efficient.
