Zustandmaschine
A Zustandmaschine, often translated as state machine or finite automaton, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The machine can change from one state to another when triggered by some external inputs; the change from one state to another is called a transition. An input sequence is processed by the machine, and the sequence of states it goes through is determined by the transitions.
The concept of a Zustandmaschine is fundamental in computer science and has wide-ranging applications. It is
Formally, a Zustandmaschine can be defined as a tuple consisting of a set of states, an alphabet