default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th CIAA 2001: Pretoria, South Africa
- Bruce W. Watson, Derick Wood:
Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers. Lecture Notes in Computer Science 2494, Springer 2002, ISBN 3-540-00400-9 - Iñaki Alegria, Maxux J. Aranzabe
, Nerea Ezeiza, Aitzol Ezeiza, Ruben Urizar:
Using Finite State Technology in Natural Language Processing of Basque. 1-12 - Anne Bergeron, Sylvie Hamel:
Cascade Decompositions are Bit-Vector Algorithms. 13-26 - Gregor von Bochmann:
Submodule Construction and Supervisory Control: A Generalization. 27-39 - Bernard Boigelot, Louis Latour:
Counting the Solutions of Presburger Equations without Enumerating Them. 40-51 - Jean-Marc Champarnaud, Gérard Duchamp:
Brzozowski's Derivatives Extended to Multiplicities. 52-64 - Jan Daciuk, Gertjan van Noord:
Finite Automata for Compact Representation of Language Models in NLP. 65-73 - Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
Past Pushdown Timed Automata. 74-86 - Jean-Philippe Dubernard, Dominique Geniet:
Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions. 87-100 - Jacques Farré, José Fortes Gálvez:
Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers. 101-114 - Nathalie Friburger, Denis Maurel:
Finite-State Transducer Cascade to Extract Proper Names in Texts. 115-124 - Tamás Gaál:
Is this Finite-State Transducer Sequentiable? 125-134 - Jorge Graña, Francisco-Mario Barcala, Miguel A. Alonso:
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries. 135-148 - Jan Holub:
Bit Parallelism - NFA Simulation. 149-160 - Markus Holzer, Martin Kutrib:
Improving Raster Image Run-Length Encoding Using Data Order. 161-176 - Frank Katritzke, Wolfgang Merzenich, Michael Thomas:
Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata. 177-189 - André Kempe:
Extraction of epsilon-Cyclesfrom Finite-State Transducers. 190-201 - Borivoj Melichar, Jan Skryja:
On the Size of Deterministic Finite Automata. 202-213 - Jim Morey, Kamran Sedig, Robert E. Mercer, M. Wayne Wilson:
Crystal Lattice Automata. 214-220 - Nadia Nedjah, Luiza de Macedo Mourelle:
Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting. 221-233 - João José Neto:
Adaptive Rule-Driven Devices - General Formulation and Case Study. 234-250 - Agata Savary:
Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction. 251-260 - Yuri Velinov:
On the Software Design of Cellular Automata Simulators for Ecological Modeling. 261-262 - Lynette van Zijl:
Random Number Generation with +-NFAs. 263-273 - Lynette van Zijl:
Supernondeterministic Finite Automata. 274-288
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-22 01:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
