Uniform Parameterisation of Phase Based Cooperations

Uniform parameterisations of phase based cooperations are defined in terms of formal language theory. For such systems of cooperations a kind of self-similarity is formalised. Based on deterministic computations in shuffle automata a sufficient condition for self-similarity is given. Under certain regularity restrictions this condition can be verified by a semi-algorithm.