<?xml version="1.0" standalone="yes"?>
<Paper uid="J94-1003">
  <Title>One-Level Phonology: Autosegmental Representations and Rules as Finite Automata</Title>
  <Section position="9" start_page="87" end_page="88" type="ackno">
    <SectionTitle>
Acknowledgments
</SectionTitle>
    <Paragraph position="0"> This research is funded by the U.K. Science and Engineering Research Council, under grant GR/G-22084. Computational Phonology:  Steven Bird and T. Mark Ellison One-Level Phonology A Constraint-Based Approach. We are grateful to John Coleman, Mark Johnson, Andr~is Kornai, Ewan Klein, Henry Thompson, Markus Walther, Bruce Wiebe, and two anonymous reviewers for comments on this work. We are also grateful to the students who attended our course at the Fifth European Summer School on Logic, Language and Information (Lisbon, August 1993), and gave valuable feedback on this work. The authors take equal responsibility for the material presented here.</Paragraph>
  </Section>
class="xml-element"></Paper>