The application of the construction of Kolmogorov complexity and of a theorem by Maslov to semiotic systems

The results obtained in V. P. Maslov’s article [1] can automatically be carried over to arbitrary semiotic systems if the string of signs is sufficiently long. We shall show in this article, by using arguments based on the ideas of Kolmogorov complexity and by applying the theorem of V. P. Maslov from [2], that one can obtain similar formulas for the distribution of various semiotic objects. In order to do this, we must introduce notions generalizing the occurrence frequency of words in corpora of texts. We also interpret a formula due to Maslov (appearing in [3]) from the point of view of the general semiotic notions introduced here.