On one approach то time decomposition of automata. I

The paper discusses time decomposition of finite automata. An automaton is decomposed into a set of components, the complexity of each not exceeding a certain resource; the functioning of elements is separated in time. This approach is necessary in software and hard- and software implementation of finite automata in control miniand micro computers. The decomposition is obtained by structuring so that the automaton is represented as a superpositional system of components of a certain form. A definition of a structured automaton is introduced and the relation of structuring: and time decomposition of automata is established.