A technique for ordering, classification, and unification of fuzzy (continuous) logic formulas describing dynamical processes in finite automata is proposed. On the example of the class of automata without memory and with simplest input action, it is shown that the technique makes it possible to significantly (in several times) reduce the number of necessary formulas.