Implementation and Application of Automata (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
294
Utgivningsdatum
2003-01-01
Upplaga
2002 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Watson, B. (ed.), Wood, D. (ed.)
Illustrationer
X, 294 p.
Dimensioner
234 x 156 x 16 mm
Vikt
427 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISSN
0302-9743
ISBN
9783540004004
Implementation and Application of Automata (häftad)

Implementation and Application of Automata

6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers

Häftad Engelska, 2003-01-01
889
Skickas inom 10-15 vardagar.
Fri frakt inom Sverige för privatpersoner.
Finns även som
Visa alla 1 format & utgåvor
This book constitutes the thoroughly refereed post-proceedings of the 6th International Conference on Implementation and Application of Automata, CIAA 2001, held in Pretoria, South Africa in July 2001. The 23 revised full papers presented together with an invited paper were carefully selected during two rounds of reviewing and revision. The topics addressed from theoretical as well as application-oriented viewpoints range from foundational and methodological issues to novel applications in object-oriented modeling, finite transducers in natural language processing, and non-deterministic finite-state models in communication protocols.
Visa hela texten

Passar bra ihop

  1. Implementation and Application of Automata
  2. +
  3. Automata Implementation

De som köpt den här boken har ofta också köpt Automata Implementation av Darrell Raymond, Derick Wood, Sheng Yu (häftad).

Köp båda 2 för 1648 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Bloggat om Implementation and Application of Automata

Innehållsförteckning

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.