Another source is Taylor Booth in his 1967 book " Sequential Machines and Automata Theory ".
2.
One of his fundamental works is " Sequential Machines and Automata Theory " ( 1967 ).
3.
All of the following are called " sequential machine models " to distinguish them from " parallel machine models ".
4.
His doctoral thesis was " A design algorithm for sequential machines and definability in monadic second-order arithmetic ."
5.
As such Householder is preferred for dense matrices on sequential machines, whilst Givens is preferred on sparse matrices, and / or parallel machines.
6.
There is no need to access external buses, main memory or internal caches during each operation as is the case with standard sequential machines.
7.
Van Emde Boas ( 1990 ) calls these three plus the pointer machine " sequential machine " models, to distinguish them from " parallel random-access machine " models.
8.
In the 1965 paper by Krohn and Rhodes, the proof of the theorem on the decomposition of finite automata ( or, equivalently sequential machines ) made extensive use of the algebraic semigroup structure.
9.
He deliberately chose the ` simplest'category of sequential machines or automata : a somewhat ironical vindication of the French philosopher Descartes'supposition that all animals are only elaborate machines or " mechanisms ".
10.
This problem can easily be solved in linear time on a sequential machine, but a parallel algorithm can do better : given processors, the problem can be solved in logarithmic time,, by the following pointer jumping algorithm:
