FEEDBACK Smiley face
Normal view MARC view ISBD view

Implementation and Application of Automata [electronic resource] :6th International Conference, CIAA 2001 Pretoria, South Africa, July 23–25, 2001 Revised Papers /

Contributor(s): Watson, Bruce W [editor.] | Wood, Derick [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2494Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002.Description: X, 294 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540363903.Subject(s): 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 LanguagesOnline resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in