<?xml version="1.0" standalone="yes"?>
<Paper uid="J04-2005">
  <Title>c(c) 2004 Association for Computational Linguistics Squibs and Discussions Comments on &amp;quot;Incremental Construction and Maintenance of Minimal Finite-State Automata,&amp;quot; by Rafael C. Carrasco and Mikel</Title>
  <Section position="6" start_page="234" end_page="234" type="concl">
    <SectionTitle>
6. Conclusions
</SectionTitle>
    <Paragraph position="0"> An algorithm for adding strings to a cyclic automaton has been presented. It is faster than the algorithm for adding strings presented in Carrasco and Forcada (2002), but it operates on sorted input data. The new algorithm is a generalized version of the first algorithm presented in Daciuk et al. (2000). The relation between the algorithm presented here and the first algorithm in Daciuk et al. (2000) is the same as that between the algorithm for adding strings in Carrasco and Forcada (2002) and the second algoritm in Daciuk et al. (2000).</Paragraph>
  </Section>
class="xml-element"></Paper>