Concepts inSubcubic algorithms for recursive state machines
Finite-state machine
A finite-state machine (FSM) or finite-state automaton, or simply a state machine, is a mathematical model used to design computer programs and digital logic circuits. It is conceived as an abstract machine that can be in one of a finite number of states. The machine is in only one state at a time; the state it is in at any given time is called the current state. It can change from one state to another when initiated by a triggering event or condition, this is called a transition.
more from Wikipedia
Recursion
Recursion is the process of repeating items in a self-similar way. For instance, when the surfaces of two mirrors are exactly parallel with each other the nested images that occur are a form of infinite recursion. The term has a variety of meanings specific to a variety of disciplines ranging from linguistics to logic.
more from Wikipedia
Control flow
In computer science, control flow (or alternatively, flow of control) refers to the order in which the individual statements, instructions or function calls of an imperative or a declarative program are executed or evaluated. Within an imperative programming language, a control flow statement is a statement whose execution results in a choice being made as to which of two or more paths should be followed.
more from Wikipedia
Infinity
Infinity refers to something without any limit, and is a concept relevant in a number of fields, predominantly mathematics and physics. Having a recognizable history in these disciplines reaching back into the time of ancient Greek civilization, the term in the English language derives from Latin infinitas, which is translated as "unboundedness". In mathematics, "infinity" is often treated as if it were a number but it is not the same sort of number as the real numbers.
more from Wikipedia