In Moore's paper " Gedanken-experiments on Sequential Machines ", the ( n; m; p ) automata ( or machines ) S are defined as having n states, m input symbols and p output symbols.
12.
With Claude Shannon, before and during his time at Bell Labs, he coauthored " Gedanken-experiments on sequential machines ", " Computability by Probabilistic Machines ", " Machine Aid for Switching Circuit Design ", and " Reliable Circuits Using Less Reliable Relays ".
13.
Since the lifespan of each state is a real number ( more precisely, non-negative real ) or infinity, it is distinguished from discrete time systems, sequential machines, and Moore machines, in which time is determined by a tick time multiplied by non-negative integers.
14.
Together with the register machine, the RAM, and the pointer machine the RASP makes up the four common sequential machine models, called this to distinguish them from the " parallel " models ( e . g . parallel random access machine ) [ cf . van Emde Boas ( 1990 ) ].
15.
To understand this statement, it is necessary to consider a computer composed of several processors executing a concurrent system : some order of execution for the processors ( seeing as sequential machines ), and for each one of these processors, the execution order for the instructions must be the same specified by the concurrent program.
