Some Aspects of the Theory of Automata with Variable Structure

Aspects of the representability of regular events in automata with variable structure (AVS) and some experiments are considered. An efficient procedure is given for the construction of a minimal automaton with periodic structure from a given finite automaton, and also an algorithm for finding the word which solves the problem of the simplest experiment on recognition of the state of such an AVS.