Implementation and application of automata : 6th international conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001 : revised papers
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2494 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Implementation and application of automata, 6th international conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, revised papers, Bruce W. Watson, Derick Wood (eds.), Berlin, Springer, 2002, 1 volume (X-288 p.), Lecture notes in computer science, 3-540-00400-9 • Implementation and Application of Automata, Texte imprimé, 9783662211861 |
Obsah:
- Using Finite State Technology in Natural Language Processing of Basque
- Cascade Decompositions are Bit-Vector Algorithms
- Submodule Construction and Supervisory Control: A Generalization
- Counting the Solutions of Presburger Equations without Enumerating Them
- Brzozowski s Derivatives Extended to Multiplicities
- Finite Automata for Compact Representation of Language Models in NLP
- Past Pushdown Timed Automata
- Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions
- Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers
- Finite-State Transducer Cascade to Extract Proper Names in Texts
- Is this Finite-State Transducer Sequentiable?
- Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
- Bit Parallelism - NFA Simulation
- Improving Raster Image Run-Length Encoding Using Data Order
- Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata
- Extraction of ?-Cycles from Finite-State Transducers
- On the Size of Deterministic Finite Automata
- Crystal Lattice Automata
- Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting
- Adaptive Rule-Driven Devices - General Formulation and Case Study
- Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction
- On the Software Design of Cellular Automata Simulators for Ecological Modeling
- Random Number Generation with ?-NFAs
- Supernondeterministic Finite Automata.