Full Decomposition of Sequential Machines with the Output Behavior Realization, March 1988

摘要

A general and unified classification of full-decompositions and formal definitions or different sorts of full-decompositions for Mealy and Moore machines are presented and theorems about the existence of full-decompositions with the output behavior realization are formulated and proved. The theorems constitute a theoretical basis for the practical decomposition algorithms and for the software system calculating different sorts of decomposition for sequential machines. Similar theorems for the case of full-decompositions with the state and output behavior realization are available.