<?xml version="1.0" standalone="yes"?>
<Paper uid="J99-3002">
  <Title>The Computational Complexity of the Correct-Prefix Property for TAGs Mark-Jan Nederhof* German Research Center for Artificial Intelligence</Title>
  <Section position="8" start_page="358" end_page="358" type="ackno">
    <SectionTitle>
Acknowledgments
</SectionTitle>
    <Paragraph position="0"> Most of the presented research was carried out within the framework of the Priority Programme Language and Speech Technology (TST) while the author was employed at the University of Groningen.</Paragraph>
    <Paragraph position="1"> The TST-Programme is sponsored by NWO (Dutch Organization for Scientific Research). An error in a previous version of this paper was found and corrected with the help of Giorgio Satta.</Paragraph>
  </Section>
class="xml-element"></Paper>