January 2018
Intermediate to advanced
220 pages
5h 5m
English
State machines are fundamental to computation. A finite state machine is a form of abstract machine. It defines a finite number of states a system can be in, as well as any events in the system that can trigger transitions between those states. Any time we need to model a complex process that proceeds through a number of states, especially ones that might loop back to earlier states, we should think about reaching for a finite state machine.
The Meaning of “State” | |
|---|---|
|
|
We need to resolve an ambiguity with the word “state.” In Elixir, when we say “state,” we mean data held in an Elixir process. In a state machine, a “state” is the name ... |
Read now
Unlock full access