<?xml version="1.0" standalone="yes"?>
<Paper uid="P94-1028">
  <Title>COMPACT REPRESENTATIONS BY FINITE-STATE TRANSDUCERS</Title>
  <Section position="6" start_page="207" end_page="207" type="concl">
    <SectionTitle>
4. CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We have informally described an algorithm which allows to compact sequential transducers used in the description of language. Experiments on large scale dictionaries have proved this algorithm to be efficient. In addition to its use in several applications, it could help to limit the growth of the size of the representations of syntactic constraints.</Paragraph>
  </Section>
class="xml-element"></Paper>