This paper considers the adequate sets and the normal forms of general logical mappings. First, the problems for k-valued logical functions and for mix-valued logical functions are considered. The adequate sets and the normal forms are obtained for both kinds of logical functions. The constructive algorithms are also provided. Then the general logical mappings are considered. Converting its structure matrix to the structure matrices of its component logical functions and vise versa are investigated and converting formulas are presented. Using the normal forms of logical functions plus the converting a logical mapping to its component functions, converting a general logical mapping into its normal form becomes obvious.
展开▼
