Strongly language disjoint checkers

Strongly language disjoint (SLD) checkers are defined. SLD checkers are to sequential systems what strongly code disjoint checkers are to combinational systems. SLD checkers are the largest class of checkers with which a functional system may achieve the totally self-checking goal. A formal definition of SLD checkers is given. The design of SLD checkers using regular combinational self-checking components is discussed.