Złożoność półgrup charakterystycznych sum prostych “A G ” automatów asynchronicznych silnie spójnych ustalonych analogów rozszerzeń związanych z izomorfizmani DFASC2

The paper presents the assumption and the evidence is carried out of the direct  product complexity of characteristic semi-groups of any number (“”) of deterministic, finite, asynchronous, highly consistent DFASC2. automata. The characteristic semi-group of the automaton interferes in the computational algorithm of the generalized homoeomorphism of the automatons. Then determination the complexity of the characteristic semi-group enables to estimate the complexity of the computational generalized homoeomorphism for the other classes of automatons. In the range of the mathematical model the conception of the determined analog of the extension of the automaton  associated with the isomorphism g0, g1 ,…, gq-1  where q is the grade of  the extensions, with the suitable assumptions it simulates the automaton variable in time. The variable automaton in time is the adequate mathematical model for the many technical and computational processes of the real time. The direct product  of automatons can be considered as the realization- parallel calculations accordingly