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