Implementation and Application of Automata 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Yu, Sheng (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Paun, Andrei (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2088
• Θέματα: Computer programming.; Artificial intelligence.; Architecture, Computer.; Computers.; Algorithms.; Computer logic.; Programming Techniques.; Artificial Intelligence.; Computer System Implementation.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.

The Fifth International Conference on Implementation and Application of - tomata (CIAA 2000) was held at the University of Western Ontario in London, Ontario, Canada on July 24-25, 2000. This conference series was formerly called the International Workshop on Implementing Automata (WIA) This volume...

Πίνακας περιεχομένων:

• Invited Lectures
• Synthesizing State-Based Object Systems from LSC Specifications
• Applications of Finite-State Transducers in Natural Language Processing
• Technical Contributions
• Fast Implementations of Automata Computations
• Regularly Extended Two-Way Nondeterministic Tree Automata
• Glushkov Construction for Multiplicities
• Implicit Structures to Implement NFA's from Regular Expressions
• New Finite Automaton Constructions Based on Canonical Derivatives
• Experiments with Automata Compression
• Computing Raster Images from Grid Picture Grammars
• A Basis for Looping Extensions to Discriminating-Reverse Parsing
• Automata for Pro-V Topologies
• Reachability and Safety in Queue Systems
• Generalizing the Discrete Timed Automaton
• Factorization of Ambiguous Finite-State Transducers
• MONA Implementation Secrets
• Cursors
• An Automaton Model of User-Controlled Navigation on the Web
• Direct Construction of Minimal Acyclic Subsequential Transducers
• Generic ?-Removal Algorithm for Weighted Automata
• An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
• Unary Language Concatenation and Its State Complexity
• Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
• State Complexity and Jacobsthal's Function
• A Package for the Implementation of Block Codes as Finite Automata
• Regional Least-Cost Error Repair
• The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata
• Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
• The MERLin Environment Applied to ?-NFAs
• Abstracts
• Visual Exploration of Generation Algorithms for Finite Automata on the Web
• TREEBAG
• Word Random Access Compression
• Extended Sequentialization of Transducers
• Lessons from INR in the Specification of Transductions
• Part-of-Speech Tagging with Two Sequential Transducers
• Solving Complex Problems Efficiently with Adaptive Automata.