Automata Implementation 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers /
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | , |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2001.
|
| Έκδοση: | 1st ed. 2001. |
| Σειρά: | Lecture Notes in Computer Science,
2214 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.
