An Efficient Algorithm for the Full Decomposition of Sequential Machines

V. Radulescu, F. Hoza, and A. Valachi (Romania)

Keywords

automata, machine decomposition, trinity algebra.

Abstract

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.

Important Links:

• DOI:
• From Proceeding (382) Applied Modelling and Simulation - 2002

Go Back