On coarseness of the functional for decomposing a sequence of symbols in a specified vocabulary of reference fragments

The paper is concerned with variation of the functional for decomposition of a sequence of symbols in a specified vocabulary of reference fragments in the cases of eliminating or adding a symbol at the and of the sequence. A theorem is proved which leads to the lower- and upper-bounds of the functional estimate and thus establishes its coarseness.