This work considers a means of implementing a detection algorithm for multiple stuck-at faults occurring within the structure of a generalized tree using, as the testing machines, a set of generalized sequential trees. It is shown that the testing machine can be implemented on a set of trees of the same depth as that of the tree which is being tested. Modifications are made to the generalized tree structure so as to facilitate the testing algorithm and in order to simplify initialization. The testing algorithm is modified so as to test this modified structure. In addition, after testing is complete, two means of reinitialization of the sequential trees are discussed. / Master of Science