|
|
|
|
LEADER |
02841nmm a2200349 u 4500 |
001 |
EB001855169 |
003 |
EBX01000000000000001019471 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
181201 ||| eng |
020 |
|
|
|a 9783540363903
|
100 |
1 |
|
|a Watson, Bruce
|e [editor]
|
245 |
0 |
0 |
|a Implementation and Application of Automata
|h Elektronische Ressource
|b 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers
|c edited by Bruce Watson, Derick Wood
|
250 |
|
|
|a 1st ed. 2002
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2002, 2002
|
300 |
|
|
|a X, 294 p
|b online resource
|
505 |
0 |
|
|a 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
|
653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
653 |
|
|
|a Computer science
|
653 |
|
|
|a Artificial Intelligence
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Formal Languages and Automata Theory
|
653 |
|
|
|a Machine theory
|
653 |
|
|
|a Artificial intelligence
|
653 |
|
|
|a Theory of Computation
|
700 |
1 |
|
|a Wood, Derick
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
490 |
0 |
|
|a Lecture Notes in Computer Science
|
028 |
5 |
0 |
|a 10.1007/3-540-36390-4
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-36390-4?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 006.3
|