Using clerk in parallel processing

Abstract

Some models of parallel computation consist of copies of a single finite automaton, connected together in a regular fashion. In such computers clerks can be a useful data structure, enabling one to simulate a more powerful computer for which optimal algorithms are easier to design. Clerks are used here to give optimal algorithms for the 3-dimensional connected is problem on a parallel processing array, and a circle construction problem on a pyramid cellular automaton.