![Implementation and Application of Automata [electronic resource] : 6th International Conference, CIAA 2001 Pretoria, South Africa, July 23–25, 2001 Revised Papers /](/search/themes/bootstrap3/images/libros.png)
Implementation and Application of Automata [electronic resource] : 6th International Conference, CIAA 2001 Pretoria, South Africa, July 23–25, 2001 Revised Papers /
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.
| Main Authors: | , , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
2002
|
| Subjects: | Computer science., Computers., Algorithms., Computer logic., Mathematical logic., Artificial intelligence., Computer Science., Artificial Intelligence (incl. Robotics)., Computation by Abstract Devices., Algorithm Analysis and Problem Complexity., Logics and Meanings of Programs., Mathematical Logic and Formal Languages., |
| Online Access: | http://dx.doi.org/10.1007/3-540-36390-4 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|