For those who are confused, here's a description of the states: 1) S0 - i have seen none of the pattern 010 2) S1, I have seen a zero 3) S2, have seen a one after a zero Transitions: 1) The only transition leading to an output '1' is S2 to S1 with an input of 0. ie. I have seen a 0 and then a 1(in state 2), and then now i'm seeing a 0 2) All other transitions lead to output 0. Note: A moore machine would have four states and is easier to understand: 1) S0 - i have seen none of the pattern 010, and output 0 2) S1, I have seen a zero, and output 0 3) S2, I have seen a one after a zero, and output 0 4) S3, I have seen a zero then a one, then a zero, so i saw the pattern and output 1 Now the moore can be reduced to a mealy machine by merging states S3 and S1, (since transitions out of both S3 and S1 are to the same states S1 and S2 on inputs 0 and 1 respectively).
using four states for any flip flop seems feasible, but does it really matter? I mean I can still implement using 3 states on any FFs ig. I haven't tried out writing the state table, but I feel it is okay both the ways. Plus does it always be a mealy state machine for pattern detector?
hello sir. you really are a great teacher. But i'm not able to understand the state diagram here. Isn't there any short-cut or some other easy way to understand the same..??
sir I am not able to understand how to draw the state diagram in sequence detector if possible can you help me out and sir if possible can you please upload some videos on merger chat method (table & graph) that would be really helpful and I like your videos the way you describes everything is impressive ....
Who need a clarification for state diagram look into this - Since we are solving for 010 S0 - when the input is 0, it will go to S1 state, if input is 1 it will be in reset state only. S1 - when the input is 1 it will go to S2, but when i/p is 0 it will remain in S1 state because it will compare 0 with 1-bit state i.e; S1 and S1=0 S2 - when the i/p is 0 it will compare 0 with 1-bit state i.e; S1, if it matches it will go to S1 state and in case it hadn't match then it will go to reset state, when i/p is 1 it will compare 1 with 1-bit state and it hadn't match with S1 state Since S1 = 0, so it will go to reset state. I think u guys will got it now. If it is useful click like.
Your lectures are easy to understand. Thank you very much for that. However, it would be even more useful if you could properly number the videos so that we can watch the videos in the correct sequence.
Yeah it is a complicated lecture, I respect to the ones who are confused, it is really confuse-able. But it didn't confuse me at all. For me, it was a great lecture as usual. Thanks Neso Academy.
Sir ,this lecture is easy but atlast in the state diagram , I don't understand why we go from S2 to S0 again , I think we have to traverse again on S2 for X=1
because S0 is a "RESET" state that we have created and if my S2 is equal to 1 then the pattern "010" for what we looking for is got damaged and then we again have to start from the starting and S2 is 01 because it will start examing the bits further when it already have "01"... Then only you will check further na that you have pattern "010" or not ... Hope this will help you .. All the best ..
At the end of the lecture, for state diagram,only S0, S1, S2 is used, can we create and use S3 as the next state to S2 instead of going from S2 to S1 again?
I have some issues considering the implementation of the circuit . I am considering that my equations form the K map might be wrong . My first doubt is if there are only 3 states or any odd number of states , I can code them only on a pair number of bits so in the truth tabel should I consider the states that are not involved? As for the K map should I make it with Don't care ? for this example we have 3 states : 00 01 10 . so the state 11 is not in the truth tabel but it appears in my K map . What do I do? Ty for helping me out.
I've implemented this 010 sequence detector with Mealy state machine with the use of two T flip flops. Here the input and output expressions are:- Ta= Qa+ X.Qb Tb= X.Qb+ X'.Qb'= X(xnor)Qb Y=X'.Qa Correct me if I'm wrong😊
+Neso Academy !! there is an error in state diagram. The output in the state diagram is always 0. Actually, we would need a new s3 state where output is 1.
For those who are confused, here's a description of the states:
1) S0 - i have seen none of the pattern 010
2) S1, I have seen a zero
3) S2, have seen a one after a zero
Transitions:
1) The only transition leading to an output '1' is S2 to S1 with an input of 0.
ie. I have seen a 0 and then a 1(in state 2), and then now i'm seeing a 0
2) All other transitions lead to output 0.
Note: A moore machine would have four states and is easier to understand:
1) S0 - i have seen none of the pattern 010, and output 0
2) S1, I have seen a zero, and output 0
3) S2, I have seen a one after a zero, and output 0
4) S3, I have seen a zero then a one, then a zero, so i saw the pattern and output 1
Now the moore can be reduced to a mealy machine by merging states S3 and S1, (since transitions out of both S3 and S1 are to the same states S1 and S2 on inputs 0 and 1 respectively).
Thx a lot
Still not very clear sir . Thanks for your effort 😁
Thank you
using four states for any flip flop seems feasible, but does it really matter? I mean I can still implement using 3 states on any FFs ig. I haven't tried out writing the state table, but I feel it is okay both the ways. Plus does it always be a mealy state machine for pattern detector?
Thank you very much now I clearly understand the topic
Hi sir!.
Ye aapki pehli video h Jo samjh Mai nhi aayi
Went like a Rocket over my head xD
I have been going to through all of your lecture, This is my third time watching this video and I still don't get it. I am going to move on..
Same happened
Go to saravanan lecture on tis topics...its awesome
well his lectures are usually the best, this one however took a bit of visualization to get through the concept
It is fairly easy if you have gone through a few finite state machines theory and examples.
someone above has shown the concept using 4 state machine ^Rahul_Madhavan
This is an interesting example of fsm @
first video with faulty concept by neso.
hello sir. you really are a great teacher.
But i'm not able to understand the state diagram here. Isn't there any short-cut or some other easy way to understand the same..??
th-cam.com/video/NNOSWnTHakY/w-d-xo.html
watch that video where he teaches about state diagram, its simpler.
this is not the same thing. That state diagram is easier then this one
sir I am not able to understand how to draw the state diagram in sequence detector if possible can you help me out and sir if possible can you please upload some videos on merger chat method (table & graph) that would be really helpful and I like your videos the way you describes everything is impressive ....
If only all prof explained as detail as you
Who need a clarification for state diagram look into this -
Since we are solving for 010
S0 - when the input is 0, it will go to S1 state, if input is 1 it will be in reset state only.
S1 - when the input is 1 it will go to S2, but when i/p is 0 it will remain in S1 state because it will compare 0 with 1-bit state i.e; S1 and S1=0
S2 - when the i/p is 0 it will compare 0 with 1-bit state i.e; S1, if it matches it will go to S1 state and in case it hadn't match then it will go to reset state, when i/p is 1 it will compare 1 with 1-bit state and it hadn't match with S1 state Since S1 = 0, so it will go to reset state.
I think u guys will got it now.
If it is useful click like.
Your lectures are easy to understand. Thank you very much for that. However, it would be even more useful if you could properly number the videos so that we can watch the videos in the correct sequence.
Yeah it is a complicated lecture, I respect to the ones who are confused, it is really confuse-able. But it didn't confuse me at all. For me, it was a great lecture as usual. Thanks Neso Academy.
I can't see what is so confusing in this prevention...... It is pretty straight forward.
Tricky but good explanation
state diagram is little confusing
Sir , plzz make an another lecture in which u have solved more problems
this lecture is not clear.....can you more explain this topic??
Yes , please
Nice explaination
That was HARD
Sir ,this lecture is easy but atlast in the state diagram , I don't understand why we go from S2 to S0 again , I think we have to traverse again on S2 for X=1
sir please do a video on analog to digital conversion and the whole chapter. please sir this chapter is in our syllabus
Draw the sequence detector to detect the sequence of the given binary number.
How to solve same problem with moore system??
Good presentation
this was a bit confusing.!!
realluly confusing
plse solve more examples in sequence detector
@@goyalbhavit bhavit can u say that understand the class pla verify bfore saying to others
@@goyalbhavit ek aadh paper pr solve krke dekh😂
HOW IS THIS STATE DIAGRAM BEING OBTAINED.....NOT CLEAR ????
Why there is no presentation on sequence generator??
when you have the input as o in S1, shouldn't it transit to to S0, as only the first state or S0 is allowed to be 0?
I can't understand how s2 state is 01
and how it goes to s2 to s1
please explain me
because S0 is a "RESET" state that we have created and if my S2 is equal to 1 then the pattern "010" for what we looking for is got damaged and then we again have to start from the starting and S2 is 01 because it will start examing the bits further when it already have "01"...
Then only you will check further na that you have pattern "010" or not ...
Hope this will help you ..
All the best ..
If U didn't UNDERSTAND this. Watch the next video your doubts will be cleared
7:44 how can we go to state S0 with input = 1 and output = 0? I think we have to stay in state S1 itself. Please explain!
Thanks
but why it went to state if output=1 from state 2 ,in case of 1overlapping is not considered?
Thank you sir
Can you make a video on different state assignment rules and state reduction rules
At the end of the lecture, for state diagram,only S0, S1, S2 is used, can we create and use S3 as the next state to S2 instead of going from S2 to S1 again?
so confusing what are you doing sir all went over my head
If a sequence 1010 alone is given, how to draw a state diagram sir
where is the non-overlapping part?
i cann't able to understand the state diagram of sequence detector
I have some issues considering the implementation of the circuit . I am considering that my equations form the K map might be wrong . My first doubt is if there are only 3 states or any odd number of states , I can code them only on a pair number of bits so in the truth tabel should I consider the states that are not involved? As for the K map should I make it with Don't care ? for this example we have 3 states : 00 01 10 . so the state 11 is not in the truth tabel but it appears in my K map . What do I do? Ty for helping me out.
Those who r confused, plz go through Sequence detector in Moris Mano at page no 258(last para). Read it n then come to this vdo
I can't understand anything ☹️regarding this state diagram
Wao,Great..Humans are smart
If you are unable to understand (as was I) refer to this lecture again after a break .. 🤗🤗 hope it'll work for u too
the output should be 1 while going from s2-s0?????
i love this video, trully amazing
after 175 videos i have to ask. Where is the opening jingle taken from?
The state diagram seems incomplete. how do we know the final state.
Could you please put the video's sequence number in th title?
sir please do verilog coding also.!
and verilog code for fsm .
can we detect the signal 010 in non overlapping method.i think can't.
Accha isme ye kaise decide hua ki 3 states hi hongi?
I didn't understand why we S0=00, S1=01 and S2=10 in step 2. Please explain.
Hello sir how to draw state assignment table for 010 table as there are 3states only what to do with rest 2. Should I use don't care?
I've implemented this 010 sequence detector with Mealy state machine with the use of two T flip flops.
Here the input and output expressions are:-
Ta= Qa+ X.Qb
Tb= X.Qb+ X'.Qb'= X(xnor)Qb
Y=X'.Qa
Correct me if I'm wrong😊
@Sneha Rajpoot, I think u considered TA, TB for 110,111(Qa,Qb,x) as don't cares, right??
I want sequence detector using Jk flip-flop
It'z not that clear in how to transit between states, but helpful >> thnks
+Neso Academy !! there is an error in state diagram. The output in the state diagram is always 0. Actually, we would need a new s3 state where output is 1.
how to develop state table when there are only there states??
can't we use moore machine?
I don't understand this topic at all.
Sir TBH, overall playlist is really easy to understand but this in this I didn't get anything🥲
hello sir, i didn't get how the state diagram has been made.kindly help me....
how many flip flop required for 3 state
Sir why you have cosidered s1 as 0?
Brother I didn't understand anything.....can u plse explain that how the state diagram will be in a brief manner.....plse.....
Seriously this is confusing
More like Automata
confusing on sequence detector ...✊
state diagram part of this lecture is quite confusing , please make it bit clear
how we jumped S1 after S2, cause after S2 output is 1 but S1 holds 0 naa????
plzzz reply....
sir i can not understand the concept..pls help
so its sequential machine that state diagram, .. hm.. it's automata . i got that lecture in college.. i see know .. :) so , that's the link.
How to consider sequence detector 010
how is s1=0?
How to device which flip flop to use?!
Nice
oooh....the first lec. from begining which i found dry....
can i except one more problem from this lecture
this is so easy. Please put your phone on silent and watch it again with concentration. you will definitely say this is so easy. :)
I am unable to understand state diagram...🙁
Helloo sir i didn't understand the state diagram clearly
this was extremely confusing jumped into a lot concepts to quickly
Lol...I watched it with a playback speed 2.
iam looking for complete lecture on random sequence counter. can you help me sir ?
Sir I didn't understood this presentation and I think many didn't
you saved me!!!
I can't understand state diagram.... Sir plss explain once again
.
state diagram is bit confusing canyou example more in simple way
It's very confusing ....pls can you explain again
State diagram is really confusing
do it for 1010
state diagram is not at all clear...
Fuck. Beautiful.
WOW, just WaaaaWWW
Jack of War2010.... Explain
Jack of War2010 you are the only one who understood this plss explain ..
arohi singh same here didn't understand anything ....i think its a first video of neso academy which i didn't understand
confused
In some topics your videos are very scattered and it is hard to find the next part after watch some video
a little bit confusing
Neat!
Yup not clear ..as previous topics