When I was earning my master's degree, I heard a lot about finite state machines (FSMs), but it was all theory - like clouds in the sky: there's a lot of water, but you can't drink it. I toiled for three months after graduating until I implemented my first FSM in code in 1981. Now, there is a programming methodology based on this concept - v-agent oriented programming (VAOP) - with many examples of its implementation. It's best to start learning about VAOP with this article on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole". With VAOP, you can implement FSM in any programming language.
@@ALLABOUTELECTRONICS but what about the moore table? isn't right that the output will be like this 11001100 ? cuz it doesn't depend on the input? or it's just a transition table so it's correct?
@@opengl-ve1bv In case of the Moore machine, depending on the input, state of the machine changes and the output is the function of that present state.
As usual great content sir❤. I love ur way of teaching and it’s easy to grasp the content in one go. How many lectures are pending sir, am referring ur videos for preparation.
hi, thank you so much for the brief and concise explanation of the finite state machine. May i know what software you use for your presentation which i really appreciated.
What should we do if we have neither state table nor state diagram. To create the other one we need one of them. How can we create the first? Or maybe in exercise we have always one of them given?
Typically in the exercise, you will be given one of them. But like if you are designing the FSM by yourself from the scratch, then based on the desired outcome for the different inputs, you should first draw the state diagram or state table. And then based on that, you can design the FSM. In one of the video, through an example of the sequence detector, I have explained that procedure. Please check this video for more info: ua-cam.com/video/PbjntQf3sGc/v-deo.htmlsi=qWoOpjbaZ3sQCmAM
In other websites it is showing that In Moore machine the output depends on the present state but in your table it is showing that it depends on the next stage.
In Moore machine, output only depends on the present state, as it is evident from the state diagram. But in the second row of the table, by mistake, the output is written as 0. (when the present input is 01). It should be 1. For the rest of the cases, it only depends on the present state. But it does not depend on the next state. Probably, you might be meaning to say an input I guess. But by mistake, you have written next state. I hope it will clear your doubt.
yess thankyou but when present state is 10 then it should be 0 but it is written 1 , so i guess the outputs of 01 and 10 have been interchanged by mistake@@ALLABOUTELECTRONICS
8:15, i didnt quite understand why on the mealy we have "2 numbers" on the transitions between states. Like we know that if the output for "00" is "1" it will "go" to "01" but what s about that aditional "0" from "1/0" ?
The second number represents the output of the machine for the corresponding input. In the mealy machine, the first number represents the input and the second number represents the output. I hope, it will clear your doubt.
• Finite State Machines: Analysis • Finite State Machines: State Table • Finite State Machines: State Diagram guyz i have presentation on these topic can anybody help me i have few questions like sequential circuit and FSM are same thing . moore and mealy is type of SC or FSM
14:30, What is meant by the input sampled right before the edge? I have also read this in a textbook but I have a bit of difficulty in understanding this concept.
Like I said, the input is synchronized to the inactive edge of the clock. So, before arriving the next clock edge, the output of the circuit will get settled. (Typically, the propagation delay of other logic gates will be less than half clock period. In this case, the input X is connected to the OR gate at the output, So once the input X is applied at the inactive edge, the stable output of the last OR gate will be available before the next active clock edge). Therefore, the best time to sample the output is just before the next clock edge. I hope, it will clear your doubt.
The state diagram shows, how the state of the machine changes with the input. And in case of the Mealy machine, the output is also shown on arrow. While in case of the Moore machine (since the output is function of only present state), so output is represented in the state itself.
For more information, check this playlist on Sequential Circuits:
ua-cam.com/play/PLwjK_iyK4LLCCpnnybEztvRqxpMyfgarS.html
When I was earning my master's degree, I heard a lot about finite state machines (FSMs), but it was all theory - like clouds in the sky: there's a lot of water, but you can't drink it. I toiled for three months after graduating until I implemented my first FSM in code in 1981. Now, there is a programming methodology based on this concept - v-agent oriented programming (VAOP) - with many examples of its implementation. It's best to start learning about VAOP with this article on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole".
With VAOP, you can implement FSM in any programming language.
i have exam tommorrow you saved my life thx!
All the best !!
@@ALLABOUTELECTRONICS but what about the moore table? isn't right that the output will be like this 11001100 ? cuz it doesn't depend on the input? or it's just a transition table so it's correct?
@@opengl-ve1bv In case of the Moore machine, depending on the input, state of the machine changes and the output is the function of that present state.
You are the best teacher, great explanation 👌🏻👌🏻
As usual my guru excelled in this lecture
As usual great content sir❤. I love ur way of teaching and it’s easy to grasp the content in one go.
How many lectures are pending sir, am referring ur videos for preparation.
I think 5-6 videos more at the most.
Please continue such finest vedios
What skills are needed for ece students..
And how to prepare for core placements.
strengthen your fundamental concepts of ece like dsd basic vsli, circuit analysis etc. Focus on any specific domain. like FPGA embedded etc.
hi, thank you so much for the brief and concise explanation of the finite state machine. May i know what software you use for your presentation which i really appreciated.
Sir, I think the state table for Moore machine is wrong... Bcoz the output only depends on present state so the output will be 11001100
@@KAA-cf3kj I think so
You are right
@@muskanustad3834 you are wrong.
Great video thanks bro
somebody put his name on my Electric Engineering degree too
Thanks for this video, please upload more videos soon on fsm sir
thanks for this video
Actually how the state diagram are writing without knowing state table or characteristic table
Pls someone let me know 😢
Just a piece of advice: whether you learn English or try an artificial intelligence speaker
except that ; everythng is great *thank you*
What's wrong with his English
@@muhammedfazal697 hard to understand. had to see subtitles to know that he said falling edge.
What should we do if we have neither state table nor state diagram. To create the other one we need one of them.
How can we create the first? Or maybe in exercise we have always one of them given?
Typically in the exercise, you will be given one of them. But like if you are designing the FSM by yourself from the scratch, then based on the desired outcome for the different inputs, you should first draw the state diagram or state table. And then based on that, you can design the FSM.
In one of the video, through an example of the sequence detector, I have explained that procedure.
Please check this video for more info: ua-cam.com/video/PbjntQf3sGc/v-deo.htmlsi=qWoOpjbaZ3sQCmAM
In other websites it is showing that In Moore machine the output depends on the present state but in your table it is showing that it depends on the next stage.
In Moore machine, output only depends on the present state, as it is evident from the state diagram. But in the second row of the table, by mistake, the output is written as 0. (when the present input is 01). It should be 1. For the rest of the cases, it only depends on the present state. But it does not depend on the next state. Probably, you might be meaning to say an input I guess. But by mistake, you have written next state. I hope it will clear your doubt.
yess thankyou but when present state is 10 then it should be 0 but it is written 1 , so i guess the outputs of 01 and 10 have been interchanged by mistake@@ALLABOUTELECTRONICS
@courcestudy933 you are right
8:15, i didnt quite understand why on the mealy we have "2 numbers" on the transitions between states. Like we know that if the output for "00" is "1" it will "go" to "01" but what s about that aditional "0" from "1/0" ?
The second number represents the output of the machine for the corresponding input. In the mealy machine, the first number represents the input and the second number represents the output. I hope, it will clear your doubt.
• Finite State Machines: Analysis
• Finite State Machines: State Table
• Finite State Machines: State Diagram
guyz i have presentation on these topic can anybody help me
i have few questions
like sequential circuit and FSM are same thing .
moore and mealy is type of SC or FSM
pls change intro song
😂😂
😂😂😂😂😂
bro 😂
No
No music=no distraction=more concentration
11:19 Shouldn't the output be dependent on current state? In that table it is depending on the next state. Someone please explain
exactly! I was so confused as well
14:30, What is meant by the input sampled right before the edge? I have also read this in a textbook but I have a bit of difficulty in understanding this concept.
Like I said, the input is synchronized to the inactive edge of the clock. So, before arriving the next clock edge, the output of the circuit will get settled. (Typically, the propagation delay of other logic gates will be less than half clock period. In this case, the input X is connected to the OR gate at the output, So once the input X is applied at the inactive edge, the stable output of the last OR gate will be available before the next active clock edge). Therefore, the best time to sample the output is just before the next clock edge. I hope, it will clear your doubt.
Amazing
V Good 🎉
Provide the notes on fsm
i don't understand the logic of the state diagram of the machines
The state diagram shows, how the state of the machine changes with the input. And in case of the Mealy machine, the output is also shown on arrow. While in case of the Moore machine (since the output is function of only present state), so output is represented in the state itself.
are u indian?
@@francescoliberi759 yes
Autumn Ridges
Gaylord Wall
hindi ni aati aapko ?
talk like google voice machine.
44164 Friesen Burgs