Comparative complexity of probabilistic and deterministic automata

An estimate of complexity is obtained for the probabilistic automaton representing a language with an isolated section point. This estimate depends on the degree of isolation of the section point and on the automata structure of the language. Examples of languages are presented, which illustrate the relation between this estimate and the estimate obtained earlier by M.  O. Rabin [Kibern. Sb. Nov. Ser. 9, 123–141 (1964)].