5. CIAA 2000:
London, Ontario, Canada
: Applications of Finite-State Transducers in Natural Language Processing.
: Experiments with Automata Compression.
: Factorization of Ambiguous Finite-State Transducers.
: Generic epsilon -Removal Algorithm for Weighted Automata.
: The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata.
Bruce W. Watson
: Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski.
: Extended Sequentialization of Transducers.
: Part-of-Speech Tagging with Two Sequential Transducers.
João José Neto
: Solving Complex Problems Efficiently with Adaptive Automata.