A flow diagram composition of Markov's normal algorithms without concluding formulas

Abstract

Four operations on normal algorithms without concluding formulas, branching, connecting, juxtaposing, and looping are introduced and corresponding theorems are proved. In this way it is shown how the main difficulties in the practical use of Markov's normal algorithms can be overcome. © 1973 BIT Foundations.