Abstract is missing.
- Synthesizing State-Based Object Systems from LSC SpecificationsDavid Harel, Hillel Kugler. 1-33 [doi]
- Applications of Finite-State Transducers in Natural Language ProcessingLauri Karttunen. 34-46 [doi]
- Fast Implementations of Automata ComputationsAnne Bergeron, Sylvie Hamel. 47-56 [doi]
- Regularly Extended Two-Way Nondeterministic Tree AutomataAnne Brüggemann-Klein, Derick Wood. 57-66 [doi]
- Glushkov Construction for MultiplicitiesPascal Caron, Marianne Flouret. 67-79 [doi]
- Implicit Structures to Implement NFA s from Regular ExpressionsJean-Marc Champarnaud. 80-93 [doi]
- New Finite Automaton Constructions Based on Canonical DerivativesJean-Marc Champarnaud, Djelloul Ziadi. 94-104 [doi]
- Experiments with Automata CompressionJan Daciuk. 105-112 [doi]
- Computing Raster Images from Grid Picture GrammarsFrank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski. 113-121 [doi]
- A Basis for Looping Extensions to Discriminating-Reverse ParsingJacques Farré, José Fortes Gálvez. 122-134 [doi]
- Automata for Pro-V TopologiesPierre-Cyrille Héam. 135-144 [doi]
- Reachability and Safety in Queue SystemsOscar H. Ibarra. 145-156 [doi]
- Generalizing the Discrete Timed AutomatonOscar H. Ibarra, Jianwen Su. 157-169 [doi]
- Factorization of Ambiguous Finite-State TransducersAndré Kempe. 170-181 [doi]
- MONA Implementation SecretsNils Klarlund, Anders Møller, Michael I. Schwartzbach. 182-194 [doi]
- CursorsVincent Le Maout. 195-207 [doi]
- An Automaton Model of User-Controlled Navigation on the WebKamal Lodaya, Ramaswamy Ramanujam. 208-216 [doi]
- Direct Construction of Minimal Acyclic Subsequential TransducersStoyan Mihov, Denis Maurel. 217-229 [doi]
- Generic epsilon -Removal Algorithm for Weighted AutomataMehryar Mohri. 230-242 [doi]
- An O(n:::2:::) Algorithm for Constructing Minimal Cover Automata for Finite LanguagesAndrei Paun, Nicolae Santean, Sheng Yu. 243-251 [doi]
- Unary Language Concatenation and Its State ComplexityGiovanni Pighizzini. 252-262 [doi]
- Implementation of a Strategy Improvement Algorithm for Finite-State Parity GamesDominik Schmitz, Jens Vöge. 263-271 [doi]
- State Complexity and Jacobsthal s FunctionJeffrey Shallit. 272-278 [doi]
- A Package for the Implementation of Block Codes as Finite AutomataPriti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan. 279-292 [doi]
- Regional Least-Cost Error RepairManuel Vilares Ferro, Victor M. Darriba, Francisco J. Ribadas. 293-301 [doi]
- The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State AutomataTodd Wareham. 302-310 [doi]
- Directly Constructing Minimal DFAs: Combining Two Algorithms by BrzozowskiBruce W. Watson. 311-317 [doi]
- The MERLin Environment Applied to *-NFAsLynette van Zijl, John-Paul Harper, Frank Olivier. 318-326 [doi]
- Visual Exploration of Generation Algorithms for Finite Automata on the WebStephan Diehl, Andreas Kerren, Torsten Weller. 327-328 [doi]
- TREEBAGFrank Drewes, Renate Klempien-Hinrichs. 329-330 [doi]
- Word Random Access CompressionJiri Dvorský, Václav Snásel. 331-332 [doi]
- Extended Sequentialization of TransducersTamás Gaál. 333-334 [doi]
- Lessons from INR in the Specification of TransductionsJ. Howard Johnson. 335-336 [doi]
- Part-of-Speech Tagging with Two Sequential TransducersAndré Kempe. 337-339 [doi]
- Solving Complex Problems Efficiently with Adaptive AutomataJoão José Neto. 340-342 [doi]