Some Closure Properties of the Family of Stochastic Languages

The purpose of the paper is to prove that the family of languages accepted by finite probabilistic automata is not closed under any of the operations catenation, catenation closure and homomorphism.