04543nam 22007455 450 991014389770332120200703234529.03-540-36390-410.1007/3-540-36390-4(CKB)1000000000211805(SSID)ssj0000323918(PQKBManifestationID)11259116(PQKBTitleCode)TC0000323918(PQKBWorkID)10304248(PQKB)11157771(DE-He213)978-3-540-36390-3(MiAaPQ)EBC3073007(PPN)155223682(EXLCZ)99100000000021180520121227d2002 u| 0engurnn|008mamaatxtccrImplementation and Application of Automata 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers /edited by Bruce Watson, Derick Wood1st ed. 2002.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2002.1 online resource (X, 294 p.) Lecture Notes in Computer Science,0302-9743 ;2494Bibliographic Level Mode of Issuance: Monograph3-540-00400-9 Includes bibliographical references at the end of each chapters and index.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.Lecture Notes in Computer Science,0302-9743 ;2494Artificial intelligenceComputersAlgorithmsComputer logicMathematical logicArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Artificial intelligence.Computers.Algorithms.Computer logic.Mathematical logic.Artificial Intelligence.Computation by Abstract Devices.Algorithm Analysis and Problem Complexity.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.511.3Watson Bruceedthttp://id.loc.gov/vocabulary/relators/edtWood Derickedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910143897703321Implementation and Application of Automata3552118UNINA