\relax 
\@writefile{toc}{\contentsline {section}{\tocsection {}{1}{Introduction}}{1}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces The Bypassing reversible move rule.}}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{2}{A Symbolic Finite-State Method}}{3}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Recurrence for $f(a,0), a \geq 0$.}}{4}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Recurrence for $f(a,1), a \geq 0$.}}{4}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Recurrence for $ f(a,b), a \geq 0, b \geq 2 $.}}{4}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Recurrence for $g(a), a \geq 0$.}}{5}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Recurrence of $f(a,b,c), a \geq 0, c \geq 0, b \geq 1 $.}}{6}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{How far can the symbolic finite state method go?}}{7}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{4}{A Conjecture and Future Work}}{7}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{APPENDICES}}{8}}
\@writefile{toc}{\contentsline {section}{\tocsection {Appendix}{A}{On the difficulty of class B21: TTF}}{8}}
\bibcite{}{1}
\@writefile{toc}{\contentsline {section}{\tocsection {Appendix}{B}{ About the program}}{9}}
\bibcite{}{2}
\bibcite{}{3}
\newlabel{tocindent-1}{0pt}
\newlabel{tocindent0}{58.61125pt}
\newlabel{tocindent1}{66.11127pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\@writefile{toc}{\contentsline {section}{\tocsection {Appendix}{}{References}}{10}}