Abstract: | We analyze the effect of the degree of isolation of a cut point on the number of states P(U, ) of a probabilistic automaton representing the language U. We give an example of a language Un consisting of words of length n such that there exist numbers ![epsi](/content/r362552810064265/xxlarge949.gif) < for which P(Un, ![epsi](/content/r362552810064265/xxlarge949.gif) )/P(Un, ) 0 as n![rarr](/content/r362552810064265/xxlarge8594.gif) .Translated from Kibernetika, No. 3, pp. 21–25, May–June, 1989. |