On stochastic languages

Some properties of languages representable in finite probabilistic automata are investigated. It is shown that the cut-point can always be changed arbitrarily. The notion of a probabilistic automaton is generalized, and it is shown that this does not affect the family of representable languages. Generalized probabilistic automata are then used for two applications. Finally, some results concerning non-regular stochastic languages over a one-letter alphabet are mentioned