Видео

This is gold. Thanks!

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.

This video is amazing and simple it really helped me a lot thankyou!!!

I love the internet

may I have a look on this design plz

I don’t understand 😢

Incredibly good video

exactly what I needed, first time user here, wasn't sure what is the deal with upper and lower buffers. I have a book which does not speak about using portacle, just a CL itself. Thank you sir!

Great❤

thank you!!!

Thank you very much, I finally understand it now 😅

U dont know how much this video helped. Cheers

Welp, thanks for the video. I now know the difference between the two but I still do not understand how to make one. Imma take this L on this assignment lol.

Mealy machine -> pure functional programming Moor machine -> imperative programming :)

thank you so much. I wonder if you want to be a prof in my university it would be helpful

Your Moore state machine has one too many transitions from state 11. Remove the transition from state 11 to state 01.

That was helpful, thanks

you are a boss 😤

This was an excellent introduction to Emacs in Portacle! Especially the Meta-x paredit-mode!

mfw the instructors share this video instead of teaching the class themselves

Missing are the input labels of the two edges originating from the 11 state: the 11->00 edge should be labeled "1", and the 11->01 edge should be labeled "0."

Thanks Bruce!!

Bruce, thank you! I'm trying to get some of my friends to try Common Lisp. You have added the icing on Shinmera's cake. I got some good reminders about Emacs commands and key bindings. Your voice is so well modulated and pleasant that I can listen at 2x speed and understand every word, and yet regular speed is pleasant too!

I love designing FSMs! Not that I have any professional use for them but hey..

Thanks for showing off Portacle. I'm very familiar with emacs/SBCL/Slime on my laptop, but have had Portacle on my "to check out" list. Now I see that it is essentially exactly what I have been using, just packaged so that it can be run from a USB device, if desired.

Good explanation. Please stop scratching the paper with the thing! lol

Please not that the reset state was missing in the examples.

holy asmr

just wonder if you only man on youtube that explains digital electronic and not from an Indian university

2 minutes and i understood more than in the half year of the curse

I think more like the moore machine since the state that your in is not during the transition it is after the transition plus it seems to make a cleaner diagram.

what is he holding

Thank you king

Do you realize that students of Mitaoe have to submit an assignment based on your video ... thank you

In the moore machine at around 4:00, the output doesn't stay at one. Instead, it's just a very short pulse. Is that a correct transition (automatically moving the machine back to initial state). I think it would instead stay at the 4th state (11)

Dear Bruce, your disclosed e-mail address seems not be valid anymore. Could you provide us a new one?

I need the material please

Who else recognized the algorithm the second the bug started walking along the walls?

I have proved that the state diagram of "flashing 4 LED example" in the video is incorrect by coding in Verilog and simulating it. If you leave your email I can send it to you.

I think the Moore machine for the "Flashing LED 1,2,3,4,3,2,1" is not correct. the author made a mistake in toggling flip-flop. Note that the T (toggle) output changes the flip=flop after one clock cylcle.

I think the Moore machine design for counter 1,2,4,8,4,2,1 is wrong becasue the toggle flip-flop change just after clock rising-edge and then the counter maintains the "1000" state for 2 clock cycles which also outputs toggle control signal for 2 clock cycles resulting in toggling T flip-flop two times and you get dir=0 again. Conclusiion: It would not work it will result as 2,4,8,4,8,4,8,4 ,... becasue of Toggling=0->1->0 for consecutive two clock cycle.

very worst explaination

good video Bruce, thanks very much

Is this some kind of small scale DHCP idea?

Never thought I would ever be first to comment on something seven years old! I looked at what you tried to achieve and find it fascinating. One more change you can consider to this system is to use some kind of flip-flop and additional circuitry to make each of the two state machines first use one clock and then the other. This means that Machine A, MA, would use clockA and Machine B, MB, would use clock B. Then depending on the flip-flop's state, they system would switch Clocks. As it now stands, I see the system as it is, as a kind of race-condition demo. You can use it as a teaching tool about race conditions, or even to prevent it by supplying a preference of one over the other. I just wonder if the lower frequency clock has higher or lower priority, i.e. does it get to decide first about the state it will adopt? If frequency is significant, then that is what this is all about. It might also be a kind of demo of what quantum entanglement is, though I don't claim any sort of mastery of the notion.

I am very grateful to you for your quick tour of Portacle. I couldn't understand how to navigate between the panels or even what the initial two panels were for. Learning Lisp isn't easy especially when one is bewildered by the IDE.

Ludo designing please!!!!

Why is toggle bit set to 1 from (state-11)-->( state 10) and (state10)-->(state01)

Hi Bruce! I'm glad RUclips recommended me your channel. And I hope we'll see more of your videos in the future. And btw thanks a lot for the visual simplicity of your videos. It's a pleasure to watch them on small screens.

sir in moore machine we have only input = where as in meanly machine we have both in put and out put --- what is the difference in practical terms ?