The following results are established:
(1)

EDOL
$$ \subseteq $$
DSPACE (log n)

(2)

EOL
$$ \subseteq $$
DSPACE ((log n)^{2})

(3)

EDTOL
$$ \subseteq $$
NSPACE (log n)

(4)

EDTOL
$$ \subseteq $$
DSPACE (log n) if and only if NSPACE (log n)
$$ \subseteq $$
DSPACE (log n)

Statement (4) follows from statement (3) above, the fact that all linear context-free languages are EDTOL languages [21], and the existence of a linear context-free language which is log-tape complete for NSPACE (log n) [15]. Furthermore, it is shown that all EOL languages are log-tape reducible to context-free languages. Hence, EOL
$$ \subseteq $$
DSPACE (log n) if and only if every context-free language is in DSPACE (log n).