© 2001

Implementation and Application of Automata

5th International Conference, CIAA 2000 London, Ontario, Canada, July 24–25, 2000 Revised Papers

  • Shen Yu
  • Andrei Păun
Conference proceedings CIAA 2000

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2088)

Table of contents

  1. Front Matter
    Pages I-XI
  2. Invited Lectures

  3. Technical Contributions

    1. Anne Bergeron, Sylvie Hamel
      Pages 47-56
    2. Anne Brüggemann-Klein, Derick Wood
      Pages 57-66
    3. Pascal Caron, Marianne Flouret
      Pages 67-79
    4. Jean-Marc Champarnaud, D. Ziadi
      Pages 94-104
    5. Jan Daciuk
      Pages 105-112
    6. Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski
      Pages 113-121
    7. Jacques Farré, José Fortes Gálvez
      Pages 122-134
    8. Pierre-Cyrille Héam
      Pages 135-144
    9. Oscar H. Ibarra
      Pages 145-156
    10. Oscar H. Ibarra, Jianwen Su
      Pages 157-169
    11. Nils Klarlund, Anders Møller, Michael I. Schwartzbach
      Pages 182-194
    12. Vincent Le Maout
      Pages 195-207
    13. K. Lodaya, R. Ramanujam
      Pages 208-216
    14. Stoyan Mihov, Denis Maurel
      Pages 217-229

About these proceedings


The Fifth International Conference on Implementation and Application of - tomata (CIAA 2000) was held at the University of Western Ontario in London, Ontario, Canada on July 24-25, 2000. This conference series was formerly called the International Workshop on Implementing Automata (WIA) This volume of the Lecture Notes in Computer Science series contains all the papers that were presented at CIAA 2000, and also the abstracts of the poster papers that were displayed during the conference. The conference addressed issues in automata application and implemen- tion. The topics of the papers presented at this conference ranged from automata applications in software engineering, natural language and speech recognition, and image processing, to new representations and algorithms for e cient imp- mentation of automata and related structures. Automata theory is one of the oldest areas in computer science. Research in automata theory has always been motivated by its applications since its early stages of development. In the 1960s and 1970s, automata research was moti- ted heavily by problems arising from compiler construction, circuit design, string matching, etc. In recent years, many new applications have been found in various areas of computer science as well as in other disciplines. Examples of the new applications include statecharts in object-oriented modeling, nite transducers in natural language processing, and nondeterministic nite-state models in c- munication protocols. Many of the new applications do not and cannot simply apply the existing models and algorithms in automata theory to their problems.


Algorithms Automat algorithm automata cognition image processing software engineering speech recognition tar

Editors and affiliations

  • Shen Yu
    • 1
  • Andrei Păun
    • 1
  1. 1.Department of Computer Science, Middlesex CollegeThe University of Western OntarioLondonCanada

Bibliographic information