Finding probability characteristics of schemes in automaton bases

We consider schemes in arbitrary finite bases of finite probabilistic automata. We determine completely correct and correct schemes. We present a method for finding the probabilistic characteristics of such schemes.