<?xml version="1.0" standalone="yes"?>
<Paper uid="P94-1028">
  <Title>COMPACT REPRESENTATIONS BY FINITE-STATE TRANSDUCERS</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> Finite-state transducers give efficient representations of many Natural Language phenomena.</Paragraph>
    <Paragraph position="1"> They allow to account for complex lexicon restrictions encountered, without involving the use of a large set of complex rules difficult to analyze. We here show that these representations can be made very compact, indicate how to perform the corresponding minimization, and point out interesting linguistic side-effects of this operation.</Paragraph>
  </Section>
class="xml-element"></Paper>