State assignment in a discrete automaton targeting an implementing low power circuit

The problem of the state assignment in a discrete automaton aimed to decrease the switching activity of memory elements in an implementing circuit is considered. A method for solving this problem based on an approach connected with the “desirable neighborhood” method is proposed.