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
Watch video Introduction to Finite State Machine Theory online without registration, duration hours minute second in high quality. This video was added by user Intermation 18 November 2021, don't forget to share it with your friends and acquaintances, it has been viewed on our site 12,759 once and liked it 326 people.