On one approach tо time decomposition of automata. II

A relation is eatablished between the class of finite automata as a whole and a class of structured automata which has been defined in the first part of the article [1]. A theorem is given for structuring finite automata whereby any finite automation $M$ can be transformed into a structured automaton which implements an automaton mapping that under certain assumptions coincides with that implemented by $M$. An example of the transformation is given.