We consider conditions for embedding of (generally speaking, discontinuous and nonpolynomial) spline spaces obtained by a removal of grid points (nests). For such spaces we present the wavelet decomposition, construct the embedding and extension matrices, and derive the corresponding decomposition and reconstruction formulas. We also consider the decomposition and restoration operators in spaces of finite sequences (flows). Bibliography: 1 title.In [1], we considered nonsmooth first order spline-wavelet decompositions obtained by a successive removal of grid points. This allowed us to simplify (comparing with smooth decompositions) formulas for computing these decompositions in such a way that the adaptivity properties of the handled flows are preserved. As was shown In [1], the wavelet decomposition is independent of the order of removing grid points. However, if we realize the process numerically, in the machine arithmetic with floating decimal point, a successive removal of a large number of grid points leads to a fast buildup of rounding errors. Hence it is reasonable to apply such an approach only for computing in the real time scale, when a delay is not admissible.In this paper, we consider the situation where delays in the processing of incoming numerical flows are admitted. In this case, it is actual to remove simultaneously groups of grid points, called nests. We consider the embedding conditions for (in general, discontinuous and nonpolynomial) spline spaces obtained by eliminating a group of grid points (nests), present their wavelet decomposition, and construct the embedding and extension matrices, as well as the corresponding decomposition and reconstruction formulas. We also consider the decomposition and restoration operators in spaces of finite sequences (flows). We deal with a single nest, but, in the last section, we show how to extend the obtained results to a set of nests.