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.
[1] Paavo Turakainen. On languages representable in rational probabilistic automata , 1969 .
[2] Paavo Turakainen,et al. On Stochastic Languages , 1968, Inf. Control..
[3] Paavo Turakainen,et al. Generalized automata and stochastic languages , 1969 .