default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th WIA 1999: Potsdam, Germany
- Oliver Boldt, Helmut Jürgensen:
Automata Implementation, 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999, Revised Papers. Lecture Notes in Computer Science 2214, Springer 2001, ISBN 3-540-42812-7 - Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem:
FA Minimisation Heuristics for a Class of Finite Languages. 1-12 - Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte:
SEA: A Symbolic Environment for Automata Theory. 13-26 - Anne Bergeron, Riccardo Catalano:
Analysis of Reactive Systems with n Timers. 27-38 - Beatrix Braune, Stephan Diehl
, Andreas Kerren, Reinhard Wilhelm:
Animation of the Generation and Computation of Finite Automata for Learning Software. 39-47 - Cristian Calude, Kai Salomaa, Sheng Yu:
Metric Lexical Analysis. 48-59 - Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu:
State Complexity of Basic Operations on Finite Languages. 60-70 - Jan Daciuk:
Treatment of Unknown Words. 71-80 - Mark G. Eramian:
Computing Entropy Maps of Finite-Automaton-Encoded Binary Images. 81-90 - Dora Giammarresi, Jean-Luc Ponty, Derick Wood:
Thompson Digraphs: A Characterization. 91-100 - Helmut Jürgensen, Ludwig Staiger:
Finite Automata Encoding Geometric Figures. 101-108 - George Anton Kiraz:
Compressed Storage of Sparse Finite-State Transducers. 109-121 - Gertjan van Noord, Dale Gerdemann:
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing. 122-139 - Gheorghe Paun, Gabriel Thierrin:
Multiset Processing by Means of Systems of Finite State Transducers. 140-157 - Markus Seuring, Michael Gössel:
A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits. 158-163 - A. N. Trahtman:
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. 164-173 - Bruce W. Watson:
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. 174-182
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 2025-03-21 23:47 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
