内容

目次

WIA and theory and practice.- Construction of efficient generalized LR parsers.- Visualization of dynamic automata using Padnon.- Automata of asynchronous behaviors.- LANGAGE: A Maple package for automaton characterization of regular languages.- In vitro implementation of finite-state machines.- Implementing WS1S via finite automata: Performance issues.- Multi-tape automata for speech and language systems: A prolog implementation.- Tools to implement automata, a first step: ASTL.- Minimal separating sets for Muller automata.- Pseudo-minimal transducers: A transducer with proper elements.- Towards a meta-normal form algorithm for context-free grammars.- A rational design for a weighted finite-state transducer library.- An efficient null-free procedure for deciding regular language membership.- Operations on extended automata.- Efficient implementation of regular languages using r-AFA.- INTEX: An integrated FST toolbox.- Precise estimation of the order of local testability of a deterministic finite automaton.- Teaching theory of computation with tape machines.- The automata theory package omega.- Practical optimizations for automata.- Sorting and doubling techniques for set partitioning and automata minimization problems.