Shakhbazyan, K. V.; Tushkina, T. A.; Lebedinskij, M. M. Questions of decomposition in conveyor computer. (Russian) Zbl 0625.68041 Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 159, 47-55 (1987). The paper deals with some structural questions connected with the working of conveyor computers. The authors give the method of decomposing an arbitrary process to a finite number of processes of special form called simple processes. This decomposition is a very general one, and, under the special assumptions that the conveyor graph is strongly connected and that the conveyer works under full loading, the proposed decomposition can be deduced to some earlier well-known decomposition procedures. Reviewer: V.Brčić Cited in 1 ReviewCited in 2 Documents MSC: 68Q70 Algebraic theory of languages and automata 68R10 Graph theory (including graph drawing) in computer science 68N99 Theory of software Keywords:conveyor computers; conveyor graph; decomposition PDFBibTeX XMLCite \textit{K. V. Shakhbazyan} et al., Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 159, 47--55 (1987; Zbl 0625.68041) Full Text: EuDML