Automata-based programming

Automata-based programming is a programming paradigm in which the program or part of it is thought of as a model of a finite-state machine (FSM) or any other (often more complicated) formal automaton (see automata theory). Sometimes a potentially infinite set of possible states is introduced, and such a set can have a complicated structure, not just an enumeration. The following properties are key indicators for automata-based programming: The whole execution of the automata-based code is a cycle of the automaton steps.

Automata-based programming

Automata-based programming is a programming paradigm in which the program or part of it is thought of as a model of a finite-state machine (FSM) or any other (often more complicated) formal automaton (see automata theory). Sometimes a potentially infinite set of possible states is introduced, and such a set can have a complicated structure, not just an enumeration. The following properties are key indicators for automata-based programming: The whole execution of the automata-based code is a cycle of the automaton steps.