Manipulations of FSMs Represented as Sequential Circuits - The Unknown Component Problem: Theory and Applications - page 127

Hint. Operations projection and determinization should be merged together into
a single operation, since projection may introduce non-determinism and we are
restricting ourselves to the representation of deterministic automata. This is a
difficult step and there is no established good procedure for doing it.
(e) Realize the operation prefix-closure for an automaton on its corresponding MV
network.
Hint. We are supposed to remove non-accepting states (and the transitions from
them). The problem is that we cannot remove non-accepting states and still
keep the MV network well-defined (specified under any input). Add the non-
accepting states to the EXDC network (this is consistent with the fact that their
next states can be any states).
(f) Realize the operation progressiveness for an automaton on its corresponding
MV network.
Hint. We are supposed to remove the accepting states that have no next state
under some input pattern. This amounts to check all the states represented by
the Acc function: if for a given present state there is an input pattern under which
its next state is in the EXDC network, then this present state should be removed
from Acc and added to the EXDC network; iterate until nothing changes.
(g) Realize the operation state minimization for an automaton on its corresponding
MV network.