REALIZATION OF DISCRETE PROBABILISTIC PROCESSES BY FINITE LINEAR AND PROBABILISTIC AUTOMATA

摘要

Let X be a finite nonempty alphabet. Denote by X~* the set of all words of finite length over X, i.e., X~* is a free monoid generated by the set X. The unit of X~* will be denoted by e, i.e., e is the empty word. If p = X_1x_2 ... x_n, where x_i ∈ X, i = l,n, then |p| = n and p~T = x_nx_n-1... x_2x_1.