<?xml version="1.0" standalone="yes"?>
<Paper uid="C88-2113">
  <Title>Parallel Intersection and Serial Composition of Finite State Transducers</Title>
  <Section position="7" start_page="538" end_page="538" type="concl">
    <SectionTitle>
7. Conclusions and Related Work
</SectionTitle>
    <Paragraph position="0"> Although it has been reported in the literature that the algorithms described here have been implemented, we are unaware of the publication of any such algorithms to date. The algorithms themselves are of interest because they formalise the semantics of finite state transducers. Also, these algorithms are similar to graph unification algorithms. Specifically, the parallel intersection and determinisation algorithms can be viewed as cyclic graph unification and graph disjunction elimination algorithms respectively.</Paragraph>
    <Paragraph position="1"> As Barton points out, a determinisation algorithm like the one presented here will not work on transducers used for generation and recognition (as opposed to simple acceptance). He claims that many FSTS are not determinisable at all. The current work provides a formal basis on which to investigate the class of detemlinisable transducers used for generation and recognition.</Paragraph>
  </Section>
class="xml-element"></Paper>