Introduction to Finite State Machine Theory

After studying digraphs and regular expressions, we have a pretty good foundation for our next topic - finite state machines. A finite state machine, or FSM, can be used to represent the flow of just about any system. It's directed edges transition us from state to state to state until we reach completion. In this episode, we introduce FSM and use regular expressions to show how they are used.
Timestamps
00:00 | Intro
03:27 | Components of a finite state machine
06:08 | Review of basic RegEx forms
08:26 | Finite state machines for basic RegEx forms
13:11 | Finite state machines for more complex RegEx forms
16:34 | Finite state machines for Ethernet preamble and SFD
19:30 | Representing FSMs with a state transition table
Hashtags
#fsm #finite #automata

[@vrakitine]

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".

[@PrevalentAA]

Brilliant! I'm in awe how clear of an explanatory video this is and how everything easily make sense. Thank you, thank you, thank you!

[@vladyslavolshevskyi106]

Thank you for your presence on this platform, don't stop please, wish you all the best

[@dwi4773]

Great channel and videos, really happy I found this.

[@abQUINTON1]

Excellent content! I'm letting others know about your channel.

[@ashlyalvarez2203]

Thank you for your videos! Im taking Discrete Math and this has been a life saver, keep on the good work , your content is gold. Learning a lot , Subscribed !

[@CK-qh5te]

Thank you! Love these videos

[@dodsjanne]

Why isn't the star (where lambda is the empty string and a in this example a character from the alpabet) -> (lambda | a)+? Like a+ means match at least one time and (lambda | a)+ means match at least one time (where the empty string is matched once for example). So wouldn't a* be equal to (lambda | a)+? Is star redundant to the grammar? Is it just a shorthand or are there other reasons for it? Thanks for your great videos, they are awesome.

[@prajwala8986]

good explainantion

[@idan4848]

you are my hero

[@4lenix]

How can I donate?

[@PrevalentAA]

For the binary machine that computes if binary input is odd or even, can't we just have 2 states, even and odd and de initial state is even(cause let's say 0 input is even) and we give it a binary number no matter how large and we just read the current state at the end? As it will transition from even to odd state based on every single digit

[@kayakMike1000]

I love the DM, but it's not my District Manager, nor is it the Dungeon Master. It's also not Danger Mouse, but that's pretty funny. DM is Discrete Mathematics!!!

[@charliesarath5770]

Heisenberg-Breaking Bad-Walter White