default search action
2nd WIA 1997: London, Ontario, Canada
- Derick Wood, Sheng Yu:
Automata Implementation, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, Revised Papers. Lecture Notes in Computer Science 1436, Springer 1998, ISBN 3-540-64694-9
Opening Address
- Derick Wood:
WIA and Theory and Practice. 1-6
Contributed Papers
- Miguel A. Alonso, David Cabrero Souto, Manuel Vilares Ferro:
Construction of Efficient Generalized LR Parsers. 7-24 - François Bertault, Gregory Kucherov:
Visualization of Dynamic Automata Using Padnon. 25-28 - Janusz A. Brzozowski, Radu Negulescu:
Automata of Asynchronous Behaviors. 29-45 - Pascal Caron:
LANGAGE: A Maple Package for Automaton Characterization of Regular Languages. 46-55 - Max H. Garzon, Y. Gao, John A. Rose, R. C. Murphy, Russell J. Deaton, Donald R. Franceschetti, Stanley Edward Stevens Jr.:
In Vitro Implementation of Finite-State Machines. 56-74 - James Glenn, William I. Gasarch:
Implementing WS1S via Finite Automata: Performance Issues. 75-86 - George Anton Kiraz, Edmund Grimley-Evans:
Multi-tape Automata for Speech and Language Systems: A Prolog Implementation. 87-103 - Vincent Le Maout:
Tools to Implement Automata, a First Step: ASTL. 104-108 - Helmut Lescow, Jens Vöge:
Minimal Separating Sets for Muller Automata. 109-121 - Denis Maurel, Laurent Chauvier:
Pseudo-minimal Transducers: A Transducer with Proper Elements. 122-132 - Charlotte L. Miller:
Towards a Meta-Normal Form Algorithm for Context-Free Grammars. 133-143 - Mehryar Mohri, Fernando C. N. Pereira, Michael Riley:
A Rational Design for a Weighted Finite-State Transducer Library. 144-158 - Jean-Luc Ponty:
An Efficient Null-Free Procedure for Deciding Regular Language Membership. 159-170 - Dominique Revuz:
Operations on Extended Automata. 171-175 - Kai Salomaa, Xiuming Wu, Sheng Yu:
Efficient Implementation of Regular Languages Using R-AFA. 176-184 - Max Silberztein:
INTEX: An Integrated FST Toolbox. 185-197 - A. N. Trahtman:
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton. 198-212 - Yuri Velinov:
Teaching Theory of Computation with Tape Machines. 213-227 - Jens Vöge, S. Ulbrand, Oliver Matz, Nils Buhrke:
The Automata Theory Package omega. 228-231 - Bruce W. Watson:
Practical Optimizations for Automata. 232-240 - Djelloul Ziadi:
Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems. 241-251
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.