General setup and diagnostic words arc considered for linear automata, arid
the necessary and sufficient conditions for their existence arc derived. U
pper bounds are established to the lengths of the minimal general words. It
is demonstrated that if a general setup (diagnostic) sequence of length k
exists for a certain linear automaton, then all sequences of the same or gr
eater length are also general setup (diagnostic) ones for that automaton.