Criteria of universality finite determined machine for machines without loss of informating class

Fiite determined machine is one of the most popular mathematical models of complex discrete systems. ln this article possibilities of the application generаble set of automate transformation groups are investigated. lt is considered relatively to the decision of denumerability problem.
Approach to а organization goal-directed behavior problem decision in class of complex discrete systems described bу one-to-one transformations (without loss of information) is offer in this scientific work. The main result of this work is definition the form of automate substitutions and conditions of automate universality for complex systems without loss of information.