Experiments with automata with weighted input alphabet

A fragment of the theory of experiments with finite automata which assumes that every symbol of the input alphabet has its own weight equal to a posit ive number is constructed. Introduction of this weight alters the concept o f a minimal experiment. Algorithms are proposed for construction of synchro nizing, absolute, and diagnostic experiments that are minimal with respect to a newly introduced criterion.