Finite alogorithmic procedures and computation theories.
Finiteness results on rewriting systems
Formules sommatoires et systèmes de numération liés aux substitutions
FSM encoding for BDD representations
We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.