Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay

We consider determinate functions with delay which are generalisations of determinate functions and introduce the notion of complexity of an $\varepsilon$-approximation of a continuous real function by a function with delay. For some classes of continuous functions for which estimates of the number of elements in the $2\varepsilon$-distinguishable set of functions are known, upper and lower estimates are obtained.