General setup and diagnostic words are considered for linear automata, and the necessary and sufficient conditions for their existence are derived. Upper 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 greater length are also general setup (diagnostic) ones for that automaton.
展开▼
