Doron Drusinsky-Yoresh

Learn More
Symbolic cover minimization is an important step within a well-known state-assignment technique for finite state machines (FSM’s) 121. Currently, multiple-valued-input logic minimization techniques are used to find a minimum symbolic cover. The former problem, however, is computationally intractable, so heuristics are used. We show a simplified technique,(More)
  • 1