Skobelev V. Analysis of automata-algebraic models

There are systematically analysed basic classes of automata-algebraic models of transducers, presented by families of controlled permutations or substitutions, by systems of equations over finite ring or by models of quantum algorithms theory. For the first time there are investigated complexity of problems of parametric identification and of identification of initial state for above pointed models, sets of fixed points of corresponded automata mappings are characterized and it is developed multi-based algebraic system intended for unified presentation of ciphersystems in the process of simulation of their behavior. Obtained results are presented in the fom of algorithms that can be used in the process of design of software intended for theoretic analysis of problems of transmisson and protection of information.