Tian, Wanning2024-08-152024-08-1519971997https://hdl.handle.net/1828/19911In this thesis, we investigate the embedding of some deterministic test sets into se­quences generated by linear finite state machines. The performance of the machines is analyzed using simulation. An alternative approach using partitioning is also proposed. Our research shows that the embedding is possible. However, finding good machines is comparatively difficult. We suggest that some modifications to the linear finite state machines may solve the problem. We present an approach of partitioning the machines which reduces the length of the test sequence.123 pagesAvailable to the World Wide WebThesis