3. WIA 1998: Rouen, France

@proceedings{DBLP:conf/wia/1998,
  editor    = {Jean-Marc Champarnaud and
               Denis Maurel and
               Djelloul Ziadi},
  title     = {Automata Implementation, Third International Workshop on Implementing
               Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised
               Papers},
  booktitle = {WIA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1660},
  year      = {1999},
  isbn      = {3-540-66652-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Jürgen Albert, Dora Giammarresi, Derick Wood:
  Extended Context-Free Grammars and Normal Form Algorithms. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Norbert Blum:
  On Parsing LL-Languages. 13-21
  Electronic Edition (Springer LINK) BibTeX
• Heiko Goeman:
  On Parsing and Condensing Substrings of LR Languages in Linear Time. 22-42
  Electronic Edition (Springer LINK) BibTeX
• Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
  Minimal Cover-Automata for Finite Languages. 43-56
  Electronic Edition (Springer LINK) BibTeX
• Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty:
  Determinization of Glushkov Automata. 57-68
  Electronic Edition (Springer LINK) BibTeX
• Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu:
  Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. 69-81
  Electronic Edition (Springer LINK) BibTeX
• Zdenek Tronícek:
  Operations on DASG. 82-91
  Electronic Edition (Springer LINK) BibTeX
• Jan Holub, Borivoj Melichar:
  Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. 92-99
  Electronic Edition (Springer LINK) BibTeX
• Denis Maurel, Brigitte Le Pévédic, Olivier Rousseau:
  The Syntactic Prediction with Token Automata: Application to HandiAS System. 100-109
  Electronic Edition (Springer LINK) BibTeX
• Thierry Poibeau:
  Bi-directional Automata to Extract Complex Phrases from Texts. 110-120
  Electronic Edition (Springer LINK) BibTeX
• Bruce W. Watson:
  A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs. 121-132
  Electronic Edition (Springer LINK) BibTeX
• Matti Nykänen:
  Using Acceptors as Transducers. 133-148
  Electronic Edition (Springer LINK) BibTeX
• Dominique L'Her, Philippe Le Parc, Lionel Marcé:
  Proving Sequential Function Chart Programs Using Automata. 149-163
  Electronic Edition (Springer LINK) BibTeX
• Marie-Chantal Beaulieu, Anne Bergeron:
  Automata and Computational Probabilities. 164-177
  Electronic Edition (Springer LINK) BibTeX
• Jean-Francis Michon, Jean-Marc Champarnaud:
  Automata and Binary Decision Diagrams. 178-182
  Electronic Edition (Springer LINK) BibTeX
• Gérard Duchamp, Marianne Flouret, Éric Laugerotte:
  Operations over Automata with Multiplicities. 183-191
  Electronic Edition (Springer LINK) BibTeX
• Ricardo Ueda Karpischek:
  Paging Automata. 192-198
  Electronic Edition (Springer LINK) BibTeX
• Yuri Velinov:
  On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment. 199-212
  Electronic Edition (Springer LINK) BibTeX
• Sandro Pedrazzini:
  The Finite State Automata's Design Patterns. 213-219
  Electronic Edition (Springer LINK) BibTeX
• Xavier Augros:
  Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set. 220-225
  Electronic Edition (Springer LINK) BibTeX
• Are Uppman, Jean-Marc Champarnaud:
  Autographe: A Graphical Version of Automate. 226-229
  Electronic Edition (Springer LINK) BibTeX
• Max Silberztein:
  INTEX 4.1 for Windows: A Walkthrough. 230-243
  Electronic Edition (Springer LINK) BibTeX