On improving the diagnostic potential of an automaton by introducing test points

Finite automata can be restructured so that the resulting automaton use all words of a specified regular set as diagnostic words. This problem can be reduced to an analogous problem for a finite set of words referred to as the cannonical basis of the regular set. Uniqueness of the basis is proved and a graphical and an analytical ways of constructing it are suggested. An algorithm which does not require selection is described that finds a set of test points which does not insure a minimal solution.