Wikipedia
In mathematics and theoretical computer science, an automatic sequence (called a k-automatic sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton. The n-th term of the sequence is a mapping of the final state of the automaton when its input is the digits of the number n in some fixed base k. A k-automatic set is a set of non-negative integers for which the sequence of values of its characteristic function is an automatic sequence: that is, membership of n in the set can be determined by a finite state automaton on the digits of n in base k.
An automaton reading the base k digits from the most significant is said to be direct reading, and from the least significant is reverse reading. However the two directions lead to the same class of sequences.
Every automatic sequence is a morphic word.
Usage examples of "automatic sequence".
Programmed into the automatic sequence was a thirty-second inspection time before the robot surgeon would continue with the removal of the organ.
Esmay stared at the instructions for the automatic sequence, wondering why it wasnt working.
It had to be an automatic sequence, because at the speed he’.
You could have the computer simply flip through them in an automatic sequence, or select cameras for special use.
If the terrorists were using the automatic sequence, as seemed likely, they probably would not notice that one camera's take was missing during the flip-through.
When the process was complete, he switched on the systems of the pod's record-and-home automatic sequence.