1 option
Implementation and Application of Automata : 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers / edited by Bruce Watson, Derick Wood.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2494.
- Lecture Notes in Computer Science, 0302-9743 ; 2494
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Computers.
- Algorithms.
- Computer logic.
- Logic, Symbolic and mathematical.
- Artificial Intelligence.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Artificial Intelligence.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (X, 294 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-36390-3
- 9783540363903
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.