Abstract is missing.
- Using Finite State Technology in Natural Language Processing of BasqueIñaki Alegria, Maxux J. Aranzabe, Nerea Ezeiza, Aitzol Ezeiza, Ruben Urizar. 1-12 [doi]
- Cascade Decompositions are Bit-Vector AlgorithmsAnne Bergeron, Sylvie Hamel. 13-26 [doi]
- Submodule Construction and Supervisory Control: A GeneralizationGregor von Bochmann. 27-39 [doi]
- Counting the Solutions of Presburger Equations without Enumerating ThemBernard Boigelot, Louis Latour. 40-51 [doi]
- Brzozowski s Derivatives Extended to MultiplicitiesJean-Marc Champarnaud, Gérard Duchamp. 52-64 [doi]
- Finite Automata for Compact Representation of Language Models in NLPJan Daciuk, Gertjan van Noord. 65-73 [doi]
- Past Pushdown Timed AutomataZhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer. 74-86 [doi]
- Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating FunctionsJean-Philippe Dubernard, Dominique Geniet. 87-100 [doi]
- Bounded-Graph Construction for Noncanonical Discriminating-Reverse ParsersJacques Farré, José Fortes Gálvez. 101-114 [doi]
- Finite-State Transducer Cascade to Extract Proper Names in TextsNathalie Friburger, Denis Maurel. 115-124 [doi]
- Is this Finite-State Transducer Sequentiable?Tamás Gaál. 125-134 [doi]
- Compilation Methods of Minimal Acyclic Finite-State Automata for Large DictionariesJorge Graña, Francisco-Mario Barcala, Miguel A. Alonso. 135-148 [doi]
- Bit Parallelism - NFA SimulationJan Holub. 149-160 [doi]
- Improving Raster Image Run-Length Encoding Using Data OrderMarkus Holzer, Martin Kutrib. 161-176 [doi]
- Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite AutomataFrank Katritzke, Wolfgang Merzenich, Michael Thomas. 177-189 [doi]
- Extraction of epsilon-Cyclesfrom Finite-State TransducersAndré Kempe. 190-201 [doi]
- On the Size of Deterministic Finite AutomataBorivoj Melichar, Jan Skryja. 202-213 [doi]
- Crystal Lattice AutomataJim Morey, Kamran Sedig, Robert E. Mercer, M. Wayne Wilson. 214-220 [doi]
- Minimal Adaptive Pattern-Matching Automata for Efficient Term RewritingNadia Nedjah, Luiza de Macedo Mourelle. 221-233 [doi]
- Adaptive Rule-Driven Devices - General Formulation and Case StudyJoão José Neto. 234-250 [doi]
- Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling CorrectionAgata Savary. 251-260 [doi]
- On the Software Design of Cellular Automata Simulators for Ecological ModelingYuri Velinov. 261-262 [doi]
- Random Number Generation with +-NFAsLynette van Zijl. 263-273 [doi]
- Supernondeterministic Finite AutomataLynette van Zijl. 274-288 [doi]