Abstract is missing.
- Edit-Distance of Weighted AutomataMehryar Mohri. 1-23 [doi]
- p-Subsequentiable TransducersCyril Allauzen, Mehryar Mohri. 24-34 [doi]
- Tabulation of Bidirectional Push Down AutomataMiguel A. Alonso, Víctor J. Díaz, Manuel Vilares Ferro. 35-46 [doi]
- Finite Automata and Non-self-Embedding GrammarsMarcella Anselmo, Dora Giammarresi, Stefano Varricchio. 47-56 [doi]
- Simulation of Gate Circuits in the Algebra of TransientsJanusz A. Brzozowski, Mihaela Gheorghiu. 57-66 [doi]
- The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover AutomataCezar Câmpeanu, Andrei Paun. 67-76 [doi]
- Regex and Extended RegexCezar Câmpeanu, Kai Salomaa, Sheng Yu. 77-84 [doi]
- Prime Decompositions of Regular Prefix CodesJurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter. 85-94 [doi]
- Implementation of Dictionaries via Automata and Decision TreesAbolfazl Fatholahzadeh. 95-105 [doi]
- Feedback-Free Circuits in the Algebra of TransientsMihaela Gheorghiu, Janusz A. Brzozowski. 106-116 [doi]
- On Minimizing Cover Automata for Finite Languages in O(n log n) TimeHeiko Körner. 117-127 [doi]
- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State TransducersJorge Graña, Gloria Andrade, Jesús Vilares. 128-137 [doi]
- Finite State Lazy Operations in NLPFranck Guingne, Florent Nicart. 138-147 [doi]
- State Complexity of Basic Operations on Nondeterministic Finite AutomataMarkus Holzer, Martin Kutrib. 148-157 [doi]
- Adaptive Automata - A Revisited ProposalJoão José Neto, César Bravo. 158-168 [doi]
- Efficient Automaton-Based Recognition for Linear Conjunctive LanguagesAlexander Okhotin. 169-181 [doi]
- Syntactic Semiring and Language EquationsLibor Polák. 182-193 [doi]
- Reduced Power AutomataKlaus Sutner. 194-202 [doi]
- A Polynomial Time Algorithm for Left [Right] Local TestabilityA. N. Trahtman. 203-212 [doi]
- Whale Calf, a Parser Generator for Conjunctive GrammarsAlexander Okhotin. 213-220 [doi]
- automata, a Hybrid System for Computational Automata TheoryKlaus Sutner. 221-227 [doi]
- A Package TESTAS for Checking Some Kinds of TestabilityA. N. Trahtman. 228-232 [doi]
- DAWG versus Suffix ArrayMiroslav Balík. 233-238 [doi]
- On Predictive Parsing and Extended Context-Free GrammarsAnne Brüggemann-Klein, Derick Wood. 239-247 [doi]
- Star Normal Form, Rational Expressions, and Glushkov WFAs PropertiesPascal Caron, Marianne Flouret. 248-254 [doi]
- Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of StringsJan Daciuk. 255-261 [doi]
- Term Validation of Distributed Hard Real-Time ApplicationsGaëlle Largeteau, Dominique Geniet. 262-269 [doi]
- Common Subsequence AutomatonZdenek Tronícek. 270-275 [doi]
- Searching for Asymptotic Error RepairManuel Vilares Ferro, Victor M. Darriba, Miguel A. Alonso. 276-281 [doi]
- Automata-Based Representations for Arithmetic Constraints in Automated VerificationConstantinos Bartzis, Tevfik Bultan. 282-288 [doi]
- On the Implementation of Compact DAWG sJan Holub, Maxime Crochemore. 289-294 [doi]
- Dynamic Programming - NFA SimulationJan Holub. 295-300 [doi]
- Deterministic Parsing of Cyclic StringsBorivoj Melichar. 301-306 [doi]