<?xml version="1.0" standalone="yes"?>
<Paper uid="C04-1011">
  <Title>Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata</Title>
  <Section position="9" start_page="0" end_page="0" type="ackno">
    <SectionTitle>
Acknowledgements
</SectionTitle>
    <Paragraph position="0"> Helpful comments from Zhiyi Chi are gratefully acknowledged. The rst author is supported by the PIONIER Project Algorithms for Linguistic Processing, funded by NWO (Dutch Organization for Scienti c Research). The second author is partially supported by MIUR (Italian Ministry of Education) under project PRIN No.</Paragraph>
    <Paragraph position="1"> 2003091149 005.</Paragraph>
  </Section>
class="xml-element"></Paper>