<?xml version="1.0" standalone="yes"?>
<Paper uid="H05-1101">
  <Title>Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP), pages 803-810, Vancouver, October 2005. c(c)2005 Association for Computational Linguistics Some Computational Complexity Results for Synchronous Context-Free Grammars</Title>
  <Section position="7" start_page="808" end_page="808" type="concl">
    <SectionTitle>
Acknowledgment
</SectionTitle>
    <Paragraph position="0"> We are indebted to Dan Melamed and Mark-Jan Nederhof for technical discussion on topics related to this paper. Dan Melamed also suggested to us the problem investigated by Theorem 2. The first author is partially supported by MIUR under project PRIN No. 2003091149 005.</Paragraph>
  </Section>
class="xml-element"></Paper>