$\text{Exercise}:6$ Show that for every context-free language there exists an accepting pda, such that the number of symbols in the stack never exceeds the length of the input string by more than one.
$\text{Exercise}:7$ Use the observation in the above exercise to show that any context-free language not containing $\lambda$ is accepted by some linear bounded automaton.
