A framework for satisfying input and output encoding constraints

Abstract

Three relevant encoding problems are input, output and state encoding. Several algorithms have been proposed for their solutions that decompose the problem into symbolic minimization (yielding a set of constraints) and constraint satisfaction. At least two exact formulations of the input encoding constraint satisfaction problem exist. However, a more important use of encoding is in state assignment of finite state machines where both input and output encoding constraints must be satisfied to obtain the most effective implementations.