A Modified Algorithm for Design of an Approximating Model of a Path Describing the Functioning of a Computing System

The paper is concerned with optimizing the algorithm of finding decomposition of a structural sequence of a path of events in a specified vocabulary of reference fragments. Rules are introduced whereby a modified algorithm is developed. Comparative estimates of the operation of the two algorithm are provided.