Realizations by stochastic finite automa
โ
J.W. Carlyle; A. Paz
๐
Article
๐
1971
๐
Elsevier Science
๐
English
โ 729 KB
It is shown that a real-valued functionf(x), defined for strings x over a finite alphabet, is of the form (fig(x) + y) exp (3[ x ]) for constants fi, y, 3, and the acceptance probability function g for a probabilistic automaton, if and only iff is of finite rank, where the latter external criterion