<p>In this paper, the problem of tracking a given reference output trajectory is investigated for the class of Boolean control networks, by resorting to their algebraic representation. First, the case of a finite-length reference trajectory is addressed, and the analysis and algorithms first proposed in (Zhang, et al., 2018) are extended to be able to deal with arbitrary initial conditions and to identify all possible solutions. The case of delayed tracking is also investigated. The approach developed for the finite-length case is then adjusted to cope with periodic reference output trajectories. First, exact tracking of periodic output trajectories from all possible initial states is considered and shown to be equivalent to exact tracking, from all possible initial states, of the finite length trajectory obtained by restricting the original one to a single period. Then, delayed tracking (both with an arbitrary delay and with a delay that is a multiple of the period) is explored. Several algorithms support the analysis and the numerical implementation of the necessary and sufficient conditions derived in this paper for the solvability of the various problems. The results of this paper are illustrated through examples.</p>