<?xml version="1.0" standalone="yes"?>
<Paper uid="C88-2113">
  <Title>Parallel Intersection and Serial Composition of Finite State Transducers</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1. Introduction
</SectionTitle>
    <Paragraph position="0"> Finite state transducers (FSTS) have been shown to be useful for modelling morphophonemic processes in an efficient way in (Karttunen 1983), (Kay 1983), (Kaplan and Kay 1985), (Karttunen, Koskenniemi and Kaplan 1987) and (Koskenniemi 1983) (but cf. (Barton 1986b), (Barton 1986a)). This paper presents a linguistically expressive parallel semantics for quasi-deterministic FSTS used as receptors and algorithms for taking the parallel intersection and serial composition of such FSTS.</Paragraph>
    <Paragraph position="1"> The intersection and composition algorithms generate composite FSTS from sets of FSTS with the same semantics as the parallel semantics of the set. SS2 presents the parallel semantics; SS3 discusses the parallel intersection algorithm. SS4 discusses the serial composition algorithm. SS5 discusses the elimination of unacceptable general nondete~rninism which can arise fi'om the composition algorithm. SS6 discusses the implementation of the interpreter which is based on the semantics presented here and the three algorithms. SS7 discusses this research in the context of other work in this area and draws some conclusions.</Paragraph>
  </Section>
class="xml-element"></Paper>