\BOOKMARK [2][]{Outline0.1}{Outline}{}
\BOOKMARK [1][]{Outline1}{Main Talk}{}
\BOOKMARK [2][]{Outline1.2}{The Model of Overhead-Free Computation}{Outline1}
\BOOKMARK [3][]{Outline1.2.1.5}{The Standard Model of Linear Space}{Outline1.2}
\BOOKMARK [3][]{Outline1.2.2.17}{Our Model of Absolutely No Space Overhead}{Outline1.2}
\BOOKMARK [2][]{Outline1.3}{The Power of Overhead-Free Computation}{Outline1}
\BOOKMARK [3][]{Outline1.3.1.31}{Palindromes}{Outline1.3}
\BOOKMARK [3][]{Outline1.3.2.49}{Linear Languages}{Outline1.3}
\BOOKMARK [3][]{Outline1.3.3.57}{Context-Free Languages with a Forbidden Subword}{Outline1.3}
\BOOKMARK [3][]{Outline1.3.4.64}{Languages Complete for Polynomial Space}{Outline1.3}
\BOOKMARK [2][]{Outline1.4}{Limitations of Overhead-Free Computation}{Outline1}
\BOOKMARK [3][]{Outline1.4.1.67}{Linear Space is Strictly More Powerful}{Outline1.4}
\BOOKMARK [2][]{Outline1.5}{Summary}{Outline1}
\BOOKMARK [3][]{Outline1.5.1.72}{}{Outline1.5}
\BOOKMARK [3][]{Outline1.5.2.73}{}{Outline1.5}
\BOOKMARK [1][]{Outline2}{Appendix}{}
\BOOKMARK [2][]{Outline2.6}{Appendix}{Outline2}
\BOOKMARK [3][]{Outline2.6.1.78}{Complete Languages}{Outline2.6}
\BOOKMARK [3][]{Outline2.6.2.79}{Improvements for Context-Free Languages}{Outline2.6}