LEADER 04543nam  22007455  450 
001 9910143897703321
005 20200703234529.0
010   $a3-540-36390-4
024 7 $a10.1007/3-540-36390-4
035   $a(CKB)1000000000211805
035   $a(SSID)ssj0000323918
035   $a(PQKBManifestationID)11259116
035   $a(PQKBTitleCode)TC0000323918
035   $a(PQKBWorkID)10304248
035   $a(PQKB)11157771
035   $a(DE-He213)978-3-540-36390-3
035   $a(MiAaPQ)EBC3073007
035   $a(PPN)155223682
035   $a(EXLCZ)991000000000211805
100   $a20121227d2002      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aImplementation and Application of Automata $e6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers /$fedited by Bruce Watson, Derick Wood
205   $a1st ed. 2002.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002.
215   $a1 online resource (X, 294 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2494
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-00400-9 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aUsing 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2494
606   $aArtificial intelligence
606   $aComputers
606   $aAlgorithms
606   $aComputer logic
606   $aMathematical logic
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
615  0$aArtificial intelligence.
615  0$aComputers.
615  0$aAlgorithms.
615  0$aComputer logic.
615  0$aMathematical logic.
615 14$aArtificial Intelligence.
615 24$aComputation by Abstract Devices.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Formal Languages.
676   $a511.3
702   $aWatson$b Bruce$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aWood$b Derick$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910143897703321
996   $aImplementation and Application of Automata$93552118
997   $aUNINA