Abstract

It follows from the proved theorems that ifM π=〈Q, ϕ〉 (whereQ={0,q 1,q 2,...,q α}) is a machine of the classM F then there exist α machinesM πi such thatM πi(〈1,c〉)=M π(〈q i,c〉) andQ i={0, 1, 2, ..., α+1} (i=1, 2, ..., α).And thus, if the way in which to an initial function of content of memoryc∈C a machine assigns a final onec′∈C is regarded as the only essential property of the machine then we can deal with the machines of the formM π=〈{0, 1, 2, ..., α}, ϕ〉 and processes π(t) (wheret=〈1,c〉,c∈C) only.Such approach can simplify the problem of defining particular machines of the classM F , composing and simplifying them