6. CIAA 2001: Pretoria, South Africa

@proceedings{DBLP:conf/wia/2001,
  editor    = {Bruce W. Watson and
               Derick Wood},
  title     = {Implementation and Application of Automata, 6th International
               Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001,
               Revised Papers},
  booktitle = {CIAA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2494},
  year      = {2002},
  isbn      = {3-540-00400-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Iñaki Alegria, Maxux J. Aranzabe, Nerea Ezeiza, Aitzol Ezeiza, Ruben Urizar:
  Using Finite State Technology in Natural Language Processing of Basque. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Anne Bergeron, Sylvie Hamel:
  Cascade Decompositions are Bit-Vector Algorithms. 13-26
  Electronic Edition (Springer LINK) BibTeX
• Gregor von Bochmann:
  Submodule Construction and Supervisory Control: A Generalization. 27-39
  Electronic Edition (Springer LINK) BibTeX
• Bernard Boigelot, Louis Latour:
  Counting the Solutions of Presburger Equations without Enumerating Them. 40-51
  Electronic Edition (Springer LINK) BibTeX
• Jean-Marc Champarnaud, Gérard Duchamp:
  Brzozowski's Derivatives Extended to Multiplicities. 52-64
  Electronic Edition (Springer LINK) BibTeX
• Jan Daciuk, Gertjan van Noord:
  Finite Automata for Compact Representation of Language Models in NLP. 65-73
  Electronic Edition (Springer LINK) BibTeX
• Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
  Past Pushdown Timed Automata. 74-86
  Electronic Edition (Springer LINK) BibTeX
• Jean-Philippe Dubernard, Dominique Geniet:
  Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions. 87-100
  Electronic Edition (Springer LINK) BibTeX
• Jacques Farré, José Fortes Gálvez:
  Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers. 101-114
  Electronic Edition (Springer LINK) BibTeX
• Nathalie Friburger, Denis Maurel:
  Finite-State Transducer Cascade to Extract Proper Names in Texts. 115-124
  Electronic Edition (Springer LINK) BibTeX
• Tamás Gaál:
  Is this Finite-State Transducer Sequentiable? 125-134
  Electronic Edition (Springer LINK) BibTeX
• Jorge Graña, Francisco-Mario Barcala, Miguel A. Alonso:
  Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries. 135-148
  Electronic Edition (Springer LINK) BibTeX
• Jan Holub:
  Bit Parallelism - NFA Simulation. 149-160
  Electronic Edition (Springer LINK) BibTeX
• Markus Holzer, Martin Kutrib:
  Improving Raster Image Run-Length Encoding Using Data Order. 161-176
  Electronic Edition (Springer LINK) BibTeX
• Frank Katritzke, Wolfgang Merzenich, Michael Thomas:
  Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata. 177-189
  Electronic Edition (Springer LINK) BibTeX
• André Kempe:
  Extraction of epsilon-Cyclesfrom Finite-State Transducers. 190-201
  Electronic Edition (Springer LINK) BibTeX
• Borivoj Melichar, Jan Skryja:
  On the Size of Deterministic Finite Automata. 202-213
  Electronic Edition (Springer LINK) BibTeX
• Jim Morey, Kamran Sedig, Robert E. Mercer, M. Wayne Wilson:
  Crystal Lattice Automata. 214-220
  Electronic Edition (Springer LINK) BibTeX
• Nadia Nedjah, Luiza de Macedo Mourelle:
  Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting. 221-233
  Electronic Edition (Springer LINK) BibTeX
• João José Neto:
  Adaptive Rule-Driven Devices - General Formulation and Case Study. 234-250
  Electronic Edition (Springer LINK) BibTeX
• Agata Savary:
  Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction. 251-260
  Electronic Edition (Springer LINK) BibTeX
• Yuri Velinov:
  On the Software Design of Cellular Automata Simulators for Ecological Modeling. 261-262
  Electronic Edition (Springer LINK) BibTeX
• Lynette van Zijl:
  Random Number Generation with +-NFAs. 263-273
  Electronic Edition (Springer LINK) BibTeX
• Lynette van Zijl:
  Supernondeterministic Finite Automata. 274-288
  Electronic Edition (Springer LINK) BibTeX