Abstract is missing.
- FA Minimisation Heuristics for a Class of Finite LanguagesJérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem. 1-12 [doi]
- SEA: A Symbolic Environment for Automata TheoryPhilippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte. 13-26 [doi]
- Analysis of Reactive Systems with n TimersAnne Bergeron, Riccardo Catalano. 27-38 [doi]
- Animation of the Generation and Computation of Finite Automata for Learning SoftwareBeatrix Braune, Stephan Diehl, Andreas Kerren, Reinhard Wilhelm. 39-47 [doi]
- Metric Lexical AnalysisCristian Calude, Kai Salomaa, Sheng Yu. 48-59 [doi]
- State Complexity of Basic Operations on Finite LanguagesCezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu. 60-70 [doi]
- Treatment of Unknown WordsJan Daciuk. 71-80 [doi]
- Computing Entropy Maps of Finite-Automaton-Encoded Binary ImagesMark G. Eramian. 81-90 [doi]
- Thompson Digraphs: A CharacterizationDora Giammarresi, Jean-Luc Ponty, Derick Wood. 91-100 [doi]
- Finite Automata Encoding Geometric FiguresHelmut Jürgensen, Ludwig Staiger. 101-108 [doi]
- Compressed Storage of Sparse Finite-State TransducersGeorge Anton Kiraz. 109-121 [doi]
- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language ProcessingGertjan van Noord, Dale Gerdemann. 122-139 [doi]
- Multiset Processing by Means of Systems of Finite State TransducersGheorghe Paun, Gabriel Thierrin. 140-157 [doi]
- A Structural Method for Output Compaction of Sequential Automata Implemented as CircuitsMarkus Seuring, Michael Gössel. 158-163 [doi]
- An Algorithm to Verify Local Threshold Testability of Deterministic Finite AutomataA. N. Trahtman. 164-173 [doi]
- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite AutomataBruce W. Watson. 174-182 [doi]