1. WIA 1996: London, Ontario, Canada

Darrell R. Raymond, Derick Wood, Sheng Yu (Eds.): Automata Implementation, First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996, Revised Papers. Lecture Notes in Computer Science 1260 Springer 1997, ISBN 3-540-63174-7 BibTeX

@proceedings{DBLP:conf/wia/1996,
  editor    = {Darrell R. Raymond and
               Derick Wood and
               Sheng Yu},
  title     = {Automata Implementation, First International Workshop on Implementing
               Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996,
               Revised Papers},
  booktitle = {WIA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1260},
  year      = {1997},
  isbn      = {3-540-63174-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Opening Address

Darrell R. Raymond: WIA and the Practice of Theory in Computer Science. 1-5 BibTeX

Contributed Papers

Morten Biehl, Nils Klarlund, Theis Rauhe: Algorithms for Guided Tree Automata. 6-25 BibTeX
Romuald Boné, Christophe Daguin, Antoine Georgevail, Denis Maurel: Time Series Forecasting by Finite-State Automata. 26-34 BibTeX
Max H. Garzon, Eugene Eberbach: Dynamical Implementation of Nondeterministic Automata and Concurrent Systems. 35-49 BibTeX
James Glenn, William I. Gasarch: Implementing WS1S via Finite Automata. 50-63 BibTeX
J. Howard Johnson, Derick Wood: Instruction Computation in Subset Construction. 64-71 BibTeX
Denis Maurel: Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials. 72-86 BibTeX
Gertjan van Noord: FSA Utilities: A Toolbox to Manipulate Finite-State Automata. 87-108 BibTeX
Jean-Luc Ponty, Djelloul Ziadi, Jean-Marc Champarnaud: A New Quadratic Algorithm to Convert a Regular Expression into an Automaton. 109-119 BibTeX
Bala Ravikumar, X. Xiong: Implementing Sequential and Parallel Programs for the Homing Sequence Problem. 120-131 BibTeX
Susan H. Rodger: Integrating Hands-on Work into the Formal Languages Course via Tools and Programming. 132-148 BibTeX
Kai Salomaa, Sheng Yu: NFA to DFA Transformation for Finite Languages. 149-158 BibTeX
Barbara Schubert: How to Use Sorting Procedures to Minimize DFA. 159-166 BibTeX
Bruce W. Watson: FIRE Lite: FAs and REs in C++. 167-188 BibTeX