Skip to main content Contents Index Prev Up Next \(\newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Chapter 11 Finite State Machines
In this chapter, we explore a powerful abstract model: finite-state machine (finite automata ). Beyond its theory, we’ll see how to use SageMath to define, model, then build, visualize and run an example of a state machine to solve a real-world problem.
Notes. State machines are often associated with tasks in relation with digital computers. However, the vast domain of applications of state machines extends from simple simulations to full control of complex industrial processes. These tasks can vary in complexity, be as simple as a parity check or a complex as managing traffic patterns, and natural language recognition and processing.
