AN EFFICIENT ALGORITHM FOR THE FULL DECOMPOSITION OF SEQUENTIAL MACHINES

摘要

This paper proposes an algorithm that simplifies the full decomposition of sequential machines, based on the trinity algebra. The proposed algorithm is much more efficient than the backtracking-based approach.