<?xml version="1.0" standalone="yes"?>
<Paper uid="J00-1002">
  <Title>Stoyan Mihov t Bulgarian Academy of Sciences</Title>
  <Section position="7" start_page="14" end_page="14" type="concl">
    <SectionTitle>
6. Conclusions
</SectionTitle>
    <Paragraph position="0"> We have presented two new methods for incrementally constructing a minimal, deterministic, acyclic finite-state automaton from a finite set of words (possibly with corresponding annotations). Their main advantage is their minimal intermediate memory requirements. 4 The total construction time of these minimal dictionaries is dramatically reduced from previous algorithms. The algorithm constructing a dictionary from sorted data can be used in parallel with other algorithms that traverse or utilize the dictionary, since parts of the dictionary that are already constructed are no longer subject to future change.</Paragraph>
  </Section>
class="xml-element"></Paper>