Finite State Machines Revisited

We're taking a deeper dive into the design of finite state machines or automatons by adding outputs to our systems, discussing the concept of memory with respect to FSMs, and detecting a match to our regular expressions from within a stream. We will also introduce the concept of a non-deterministic automaton.
Timestamps
00:00 | Intro
01:03 | Review of the components of a finite state machine
04:15 | Generating output with a finite state machine
05:08 | Distinguishing Mealy and Moore machines based on output
06:15 | "Remembering" a sequence with a finite state machine
10:59 | Representing outputs on the FSM diagram or graph
13:02 | Justification for defining all possible transitions from a state
17:18 | Identifying a matching RegEx within a sequence
28:02 | Introduction to non-deterministic finite automaton
Hashtags
#fsm #nondeterministic #regex

[@TechyedYT]

well explained

[@tinchovm85]

Thank you so much for this content.

[@user-lx8mg5oj8e]

awesome video! really help me a lot

[@sudiptasahoo5699]

what is the name of the founder i want to follow him on social media.......such an inspiration