WIA '97 Conference:     Final Call   Program   Transportation and Accomodation   Registration

Conference Program

1997 International Workshop on Implementing Automata

University of Western Ontario
London, Ontario, Canada

September 18th, 19th, and 20th, 1997

Thursday, September 18th   [Mogenson building]
• Registration   (8:00 am)
• Session 1  (9:00-10:50 am)
  
• Session 2  (11:00-12:20 am)
  
• Session 3  (1:50-4:00 am)
  
• Bus departs for Stratford   (4:00 pm)

Friday, September 19th   [Mogenson building]

• Session 4   (9:00-10:40 am)
  
• Session 5   (10:50-12:10 am)
  
• Session 6   (1:40-3:40 am)
  
• Session 7   (3:50-6:00 am)
  
• WIA General meeting   (6:00 pm)

Saturday, September 20th   [Western Science Centre]

• Session 8  (9:00-10:40 am)
  
• Demonstrations   (10:40 am)

Thursday, September 18, 1997

• 8:00   Registration

Session 1:

9:00 - 9:10  

Welcome
by H. Jürgensen, S. Yu

9:10 - 9:30  

Opening Speech
by D. Wood

9:30 - 10:10  

Practical Optimizations for Automata
by B. Watson

10:10 - 10:50  

Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems
by D. Ziadi




10:50 - 11:00   Coffee Break

Session 2:

11:00 - 11:40

An Efficient epsilon-Free Procedure for Deciding Regular Language Membership
by J.-L. Ponty

11:40 - 12:20

An Efficient Implementation of Regular Languages Using r-AFA
by H. Cheung, K. Salomaa, X. Wu, S. Yu

12:20 - 1:50  Lunch

Session 3:

1:50 - 2:30  

Rational Design for a Weighted Finite-State Transducer Library
by M. Mohri, F. Pereira, M. Riley

2:30 - 3:10  

Pseudo-Minimum Transducers: Building Minimum Subsequential Finite-State Transducers
by D. Maurel, L. Chauvier

3:10 - 3:50  

INTEX: An FST Toolbox
by M. Silberztein

4:00   Bus departs for Stratford -- dinner and theatre

Friday, September 19, 1997

9:00 - 10:00  

Invited talk: Asynchronous Behavior Automata
by J.A. Brzozowski

10:00 - 10:40  

In Vitro Implementation of Finite-State Machines
by M. Garzon, Y. Gao, J.A. Rose, R. Murphy, R. Deaton D.R. Franceschetti, S.E. Stevens, Jr.

10:40 - 10:50   Coffee Break

Session 5:

10:50 - 11:30  

LANGAGE: A Maple Package for Automaton Characterization of Regular Languages
by P. Caron

11:30 - 12:10  

Precise Upper Bound of the Order of Local Testability of Finite Automata
by A. Trahtman

12:10 - 1:40   Lunch

Session 6:

1:40 - 2:20  

Minimal Separating Sets for Müller Automata
by H. Lescow, J. Voge

2:20 - 3:00  

Construction of Efficient Generalized LR Parsers
by M. A. A. Pardo, D. Cabrero, M. Vilares

3:00 - 3:40  

Towards a Meta-Normal Form Algorithm for Context-Free Grammars
by C. Miller

3:40 - 3:50   Coffee break

Session 7:

3:50 - 4:30  

Implementing WS1S via Finite Automata: Performance Issues
by J. Glenn, W. Gasarch

4:30 - 5:10  

Teaching Theory of Computation with Tape Machines
by Y. Velinov

5:10 - 5:50  

Multi-Tape Automata for Speech and Language Systems: A Prolog Implementation
by G.A. Kiraz, E. Grimley-Evans

6:00 - 6:20  

WIA general meeting -- Everyone is welcome

Saturday, September 20, 1997

9:00 - 9:20  

Visualization of Dynamic Automata Using Padnon
by F. Bertault, G. Kucherov

9:20 - 9:40  

Tools to Implement Automata, A First Step: ASTL
by V. Le Maout

9:40 - 10:00  

Operations on Extended Automata
by D. Revuz

10:00 - 10:20  

The Automata Theory Package Omega
by J. Voge, S. Ulbrand, O. Matz, N. Buhrke

10:20 - 10:30  

Closing Remarks
by S. Yu

10:40 - 12:00   Demonstrations