5. CIAA 2000: London, Ontario, Canada

@proceedings{DBLP:conf/wia/2000,
  editor    = {Sheng Yu and
               Andrei Paun},
  title     = {Implementation and Application of Automata, 5th International
               Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000,
               Revised Papers},
  booktitle = {CIAA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2088},
  year      = {2001},
  isbn      = {3-540-42491-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• David Harel, Hillel Kugler:
  Synthesizing State-Based Object Systems from LSC Specifications. 1-33
  
• Lauri Karttunen:
  Applications of Finite-State Transducers in Natural Language Processing. 34-46
  
• Anne Bergeron, Sylvie Hamel:
  Fast Implementations of Automata Computations. 47-56
  
• Anne Brüggemann-Klein, Derick Wood:
  Regularly Extended Two-Way Nondeterministic Tree Automata. 57-66
  
• Pascal Caron, Marianne Flouret:
  Glushkov Construction for Multiplicities. 67-79
  
• Jean-Marc Champarnaud:
  Implicit Structures to Implement NFA's from Regular Expressions. 80-93
  
• Jean-Marc Champarnaud, Djelloul Ziadi:
  New Finite Automaton Constructions Based on Canonical Derivatives. 94-104
  
• Jan Daciuk:
  Experiments with Automata Compression. 105-112
  
• Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
  Computing Raster Images from Grid Picture Grammars. 113-121
  
• Jacques Farré, José Fortes Gálvez:
  A Basis for Looping Extensions to Discriminating-Reverse Parsing. 122-134
  
• Pierre-Cyrille Héam:
  Automata for Pro-V Topologies. 135-144
  
• Oscar H. Ibarra:
  Reachability and Safety in Queue Systems. 145-156
  
• Oscar H. Ibarra, Jianwen Su:
  Generalizing the Discrete Timed Automaton. 157-169
  
• André Kempe:
  Factorization of Ambiguous Finite-State Transducers. 170-181
  
• Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
  MONA Implementation Secrets. 182-194
  
• Vincent Le Maout:
  Cursors. 195-207
  
• Kamal Lodaya, Ramaswamy Ramanujam:
  An Automaton Model of User-Controlled Navigation on the Web. 208-216
  
• Stoyan Mihov, Denis Maurel:
  Direct Construction of Minimal Acyclic Subsequential Transducers. 217-229
  
• Mehryar Mohri:
  Generic epsilon -Removal Algorithm for Weighted Automata. 230-242
  
• Andrei Paun, Nicolae Santean, Sheng Yu:
  An O(n²) Algorithm for Constructing Minimal Cover Automata for Finite Languages. 243-251
  
• Giovanni Pighizzini:
  Unary Language Concatenation and Its State Complexity. 252-262
  
• Dominik Schmitz, Jens Vöge:
  Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games. 263-271
  
• Jeffrey Shallit:
  State Complexity and Jacobsthal's Function. 272-278
  
• Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan:
  A Package for the Implementation of Block Codes as Finite Automata. 279-292
  
• Manuel Vilares Ferro, Victor M. Darriba, Francisco J. Ribadas:
  Regional Least-Cost Error Repair. 293-301
  
• Todd Wareham:
  The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. 302-310
  
• Bruce W. Watson:
  Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski. 311-317
  
• Lynette van Zijl, John-Paul Harper, Frank Olivier:
  The MERLin Environment Applied to *-NFAs. 318-326
  
• Stephan Diehl, Andreas Kerren, Torsten Weller:
  Visual Exploration of Generation Algorithms for Finite Automata on the Web. 327-328
  
• Frank Drewes, Renate Klempien-Hinrichs:
  TREEBAG. 329-330
  
• Jiri Dvorský, Václav Snásel:
  Word Random Access Compression. 331-332
  
• Tamás Gaál:
  Extended Sequentialization of Transducers. 333-334
  
• J. Howard Johnson:
  Lessons from INR in the Specification of Transductions. 335-336
  
• André Kempe:
  Part-of-Speech Tagging with Two Sequential Transducers. 337-339
  
• João José Neto:
  Solving Complex Problems Efficiently with Adaptive Automata. 340-342