Automata implementation : 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999 : revised papers
Αποθηκεύτηκε σε:
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | , |
| Μορφή: | Livre numérique |
| Γλώσσα: | Anglais |
| Έκδοση: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Σειρά: | Lecture notes in computer science
2214 |
| Θέματα: | |
| Διαθέσιμο Online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Σημείωση: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automata implementation, 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999, revised papers, Oliver Boldt, Helmut Jürgensen (eds.), New York, Springer, 2001, 1 volume, Lecture notes in computer science, 3-540-42812-7 • Automata Implementation, Texte imprimé, 9783662197233 |
Πίνακας περιεχομένων:
- FA Minimisation Heuristics for a Class of Finite Languages
- SEA: A Symbolic Environment for Automata Theory
- Analysis of Reactive Systems with n Timers
- Animation of the Generation and Computation of Finite Automata for Learning Software
- Metric Lexical Analysis
- State Complexity of Basic Operations on Finite Languages
- Treatment of Unknown Words
- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images
- Thompson Digraphs: A Characterization
- Finite Automata Encoding Geometric Figures
- Compressed Storage of Sparse Finite-State Transducers
- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
- Multiset Processing by Means of Systems of Finite State Transducers
- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits
- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata.