An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines.

Riccardo Forth Paul Molitor An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines. 61-66 2000 conf/aspdac/2000 ASP-DAC http://doi.acm.org/10.1145/368434.368519 db/conf/aspdac/aspdac2000.html#ForthM00