If Y i−1 is regular, then so is Y i since (as we will show) • C i and maps x to the set of starred candidates that C i will prune; ¬ denotes the complement of a regular language; and D is a transducer that removes all 's.
pRODUCE = Y n • pRON is regular as claimed.