In this episode, David Khourshid gives the rundown on how finite state machines can make your app more testable, more resilient to bugs, and easier to refactor.
David's initial interest in finite state machines stemmed from his background in music. With music, there is a universal notation that crosses genre boundaries. David thought what if there could be music notation for logic? Well, it ends up people have been trying to figure this out for the last thirty years.
A finite state machine can only be in exactly one state out of a limited number of possible states. The machine can transition to another state through explicitly defined events.
David also chats with Kent about extended finite state machines, how state machines can be used to simplify integration testing, the differences between xstate and redux.