4. WIA 1999: Potsdam, Germany

@proceedings{DBLP:conf/wia/1999,
  editor    = {Oliver Boldt and
               Helmut J{\"u}rgensen},
  title     = {Automata Implementation, 4th International Workshop on Implementing
               Automata, WIA'99, Potsdam, Germany, July 17-19, 1999, Revised
               Papers},
  booktitle = {WIA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2214},
  year      = {2001},
  isbn      = {3-540-42812-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem:
  FA Minimisation Heuristics for a Class of Finite Languages. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte:
  SEA: A Symbolic Environment for Automata Theory. 13-26
  Electronic Edition (Springer LINK) BibTeX
• Anne Bergeron, Riccardo Catalano:
  Analysis of Reactive Systems with n Timers. 27-38
  Electronic Edition (Springer LINK) BibTeX
• Beatrix Braune, Stephan Diehl, Andreas Kerren, Reinhard Wilhelm:
  Animation of the Generation and Computation of Finite Automata for Learning Software. 39-47
  Electronic Edition (Springer LINK) BibTeX
• Cristian Calude, Kai Salomaa, Sheng Yu:
  Metric Lexical Analysis. 48-59
  Electronic Edition (Springer LINK) BibTeX
• Cezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu:
  State Complexity of Basic Operations on Finite Languages. 60-70
  Electronic Edition (Springer LINK) BibTeX
• Jan Daciuk:
  Treatment of Unknown Words. 71-80
  Electronic Edition (Springer LINK) BibTeX
• Mark G. Eramian:
  Computing Entropy Maps of Finite-Automaton-Encoded Binary Images. 81-90
  Electronic Edition (Springer LINK) BibTeX
• Dora Giammarresi, Jean-Luc Ponty, Derick Wood:
  Thompson Digraphs: A Characterization. 91-100
  Electronic Edition (Springer LINK) BibTeX
• Helmut Jürgensen, Ludwig Staiger:
  Finite Automata Encoding Geometric Figures. 101-108
  Electronic Edition (Springer LINK) BibTeX
• George Anton Kiraz:
  Compressed Storage of Sparse Finite-State Transducers. 109-121
  Electronic Edition (Springer LINK) BibTeX
• Gertjan van Noord, Dale Gerdemann:
  An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing. 122-139
  Electronic Edition (Springer LINK) BibTeX
• Gheorghe Paun, Gabriel Thierrin:
  Multiset Processing by Means of Systems of Finite State Transducers. 140-157
  Electronic Edition (Springer LINK) BibTeX
• Markus Seuring, Michael Gössel:
  A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits. 158-163
  Electronic Edition (Springer LINK) BibTeX
• A. N. Trahtman:
  An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. 164-173
  Electronic Edition (Springer LINK) BibTeX
• Bruce W. Watson:
  A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. 174-182
  Electronic Edition (Springer LINK) BibTeX