Using automaton model to determine the complexity of algorithmic problems for virtual laboratories

This paper describes automaton model of reference algorithm for constructing a correct solution of algorithmic problems for virtual laboratories. This model is developed on the basis of the automated control object. In addition, a method for formal determination of the problem variant's complexity and an example of evaluating the complexity function are presented. The complexity function defines the dependency between the resulting complexity of problem variant and its properties and provides the opportunity of variants' automatic construction with a predetermined complexity.